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 04:14Victor MerckléVictor MerckléScore: 6,712Success
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 04:176,58413,369,5745,794,00002,113,536
2Jun 23, 2026 04:176,60713,321,0085,815,00002,113,536
3Jun 23, 2026 04:176,69813,386,1865,895,00002,113,536
4Jun 23, 2026 04:176,70113,406,8655,897,00002,113,536
5Jun 23, 2026 04:176,71213,373,7285,907,00002,113,536
6Jun 23, 2026 04:176,73013,369,9955,923,00002,113,536
7Jun 23, 2026 04:176,76513,577,9915,954,00002,113,536
8Jun 23, 2026 04:176,78813,584,1395,974,00002,113,536
9Jun 23, 2026 04:176,81413,477,0985,997,00002,113,536