I can’t speak for the other solutions, but I tried to take compile-time into account for the Julia results by calling the run_sieve! function once before the main timed code, but I might not have fully accounted for it.
I did try to create a custom sysimage and try package precompilation, but the sysimage took forever to create and it didn’t seem to affect the results much. Package precompilation also seemed to have little effect, maybe just making the results a bit more consistent? I’m not sure.
Is it possible to speed up calculation further with LoopVectorization.jl?
Maybe, but one of the rules is that there should be no external dependencies to actually calculate the sieve. Plus, bit arrays need to make sure that no two chunks are accessed at the same time. I think you can implement that, though, by checking that the step in the factor clearing loop is greater than one chunk.
Pull requests are really welcome in this regard.