Speed improvement for 128-bit integers
Speed improvement for 128-bit integers

x2 < 2^64 in most cases, this means that x2 / primes[l] will use 64-bit division. Old code used x / (prime * primes[l]) which uses slow 128-bit division.
kimwalisch/primecount,kimwalisch/primecount,kimwalisch/primecount