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 23, 2026 06:32Victor MerckléVictor MerckléScore: 6,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 06:355,92812,711,6055,217,00002,113,536
2Jun 23, 2026 06:355,97312,754,4195,257,00002,113,536
3Jun 23, 2026 06:356,02012,750,8765,298,00002,113,536
4Jun 23, 2026 06:356,02912,750,1435,306,00002,113,536
5Jun 23, 2026 06:356,04512,789,8645,320,00002,113,536
6Jun 23, 2026 06:356,06312,823,3885,336,00002,113,536
7Jun 23, 2026 06:356,06812,806,6385,340,00002,113,536
8Jun 23, 2026 06:356,07213,144,5195,344,00002,113,536
9Jun 23, 2026 06:356,34213,069,5985,581,00002,113,536