Counting the prime numbers up to N: An elementary approach in almost O(√N) time | Dark Hacker News