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 listApr 18, 2026 20:13Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 23:25Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 00:57013,679,3274,078,000024,576Exit with code 99: saw value above 31 bitsstderr
2Apr 18, 2026 20:1335,89053,003,87430,565,0001,018,0002,273,280
3Apr 18, 2026 20:1335,89456,397,02330,569,0001,018,0002,273,280
4Apr 18, 2026 20:1335,91454,955,42331,604,00002,273,280
5Apr 18, 2026 20:1335,91558,108,22030,586,0001,019,0002,404,352
6Apr 18, 2026 20:1335,91553,752,16431,605,00002,404,352
7Apr 18, 2026 20:1335,97055,053,19330,633,0001,021,0002,273,280
8Apr 18, 2026 20:1335,97554,073,77130,637,0001,021,0002,396,160
9Apr 18, 2026 20:1336,01153,785,63531,690,00002,404,352
10Apr 18, 2026 20:1336,05256,612,38630,703,0001,023,0002,396,160