Sum of prime numbers Andrey Tsvetkov

Compute the sum of all prime numbers in a stream of binary integers as fast as possible.

Input: 1 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of all values that are prime, printed as a decimal string.

Back to listJun 11, 2026 05:42Victor MerckléVictor MerckléScore: 9,004Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 05:458,88915,202,6957,823,00002,113,536
2Jun 11, 2026 05:458,97115,296,4767,895,00002,113,536
3Jun 11, 2026 05:458,98215,242,4097,905,00002,113,536
4Jun 11, 2026 05:458,99515,545,7077,916,00002,113,536
5Jun 11, 2026 05:459,00415,278,9737,924,00002,113,536
6Jun 11, 2026 05:459,02715,350,8147,944,00002,113,536
7Jun 11, 2026 05:459,06115,568,9057,974,00002,113,536
8Jun 11, 2026 05:459,21515,878,0118,110,00002,113,536
9Jun 11, 2026 05:459,30515,623,5118,189,00002,113,536