Fast prime counting algorithms (Euler #543, 120x faster than sieve)

Show HN: Fast prime counting algorithms (Euler #543, 120x faster than sieve)

Fast prime counting algorithms (Euler #543, 120x faster than sieve) operates in show hn launch.

Profile

I wrote an article documenting my experience solving Project Euler problem 543. It's a surprisingly deep problem, and using a specialized algorithm sped up my solution by two orders of magnitude. (Wrote initial draft 12/2016, updated 8/2019).https://acgan.sh/posts/2016-12-23-prime-counting.htmlI'd love some feedback here - in general I'm quite surprised this isn't a well known technique in many libraries (even amongst my mathy friends).

Within the show hn launch space, the company focuses on its core offering rather than a broad product line.

Its current recorded stage is Show HN launch.

Website: acgan.sh/posts/2016-12-23-prime-counting.htmlI