Programming Language Benchmark 2

[Benny]

Had a hunch this might’ve been a thread already. So the benchmark can be optimized with additional masking right off the bat?

How to shift bits faster

I thought I’d share something that I’ve run into before, and that I’ve seen a couple of times now on this forum (most recently in this topic). If you want to shift the integer n to the left or right by k bits, the natural way to do it is simply n << k or n >> k. However, this is not the most efficient way, since Julia’s shift operator differs from the native shift operator. On 64-bit CPUs, the shift count is masked with 63, so trying to shift to the left with 65 bits results in shifting to the …