Mini-Challenge: Rudin-Shapiro Sequence

[John Keith]

A simple programming challenge to stretch your brains before Valentin's next round: Just write the most efficient program you can for your favorite HP calculator to return at least 1000 terms of the Rudin-Shapiro sequence as an array or list. To be clear, I am referring to what the Wikipedia article calls r(n) but you may also submit a program for u(n) if you like for "extra credit"

The winner will be determined by the lowest product of (program size in bytes) * (execution time in seconds).

For the RPL series, speed is to be timed on an HP 50g in approximate mode. For other calculators including the HP-71B and the Prime, execution time can only be compared with other programs on the same model of calculator.

Older calculators can play along too, just compute as many terms as memory allows and scale the execution time accordingly.