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 listFeb 5, 2026 20:15vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:17M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:1708,963,7401,191,00002,113,536expected "6442459076 ", got " "
2May 17, 2026 07:1708,688,6091,194,00002,113,536expected "6442459076 ", got " "
3May 17, 2026 07:1708,421,8141,270,00002,113,536expected "6442459076 ", got " "
4Feb 5, 2026 20:163,45120,584,7871,012,0002,025,0002,502,656
5Feb 5, 2026 20:163,49117,794,1181,024,0002,048,0002,498,560
6Feb 5, 2026 20:153,49225,214,6541,024,0002,049,0002,498,560
7Feb 5, 2026 20:153,49825,674,1471,026,0002,052,0002,502,656
8Feb 5, 2026 20:163,56618,964,2461,046,0002,092,0002,498,560
9Feb 5, 2026 20:153,66618,965,1301,075,0002,151,0002,498,560