:-)

thank( you );

Briliant solution!

Another great kata from you. Thanks, DM!

Haha! You know it is possible, but your cached bitset works better. Bravo!

😁 Always a pleasure to fork your ✨ solutions, dear...

👍

See my comment on the fork: you will understand why... my old reflex is C-style :-))))) \

Could write it in 6809 8 bit assembly :-)

:-)
You know what ? I'm 60 (yop a gran'pa programmer). Began programming in 1979... with 68000 assembly my boss was a p.. in the ... for ANY SINGLE CPU CYCLE...
Want the whole story: We had to rasterize an A0 plot, black and white. Makes something like 1 or 2 Mpixels. Memory chips were so expensive: my boss gave me a hardware with 256k (yop) of (static) RAM, and a 20Mo (yes, Mo) hard drive and told me: do the shit with what you have :-)
Actually with modern pipelines and cache, had to readapt... Performance is not a matter of cycles, but a matter of data, cache line and prefetch and branch prediction and...

The change to multiplication is brilliant. It's sad that a redundant cast is still needed to avoid the ugly warning

C-style cast makes it 98% close. XD
Your idea with ranges sounds great.

That was my approach too

this is genius!

masterpiece

No, using xor does not make the function redundant.