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 7, 2026 05:54vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 05:27M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 05:27011,718,9271,204,00002,117,632expected "6442459076 ", got "1 "stderr
2May 17, 2026 05:2709,396,5441,195,00002,117,632expected "6442459076 ", got "1 "stderr
3May 17, 2026 05:2709,418,9831,207,00002,117,632expected "6442459076 ", got "1 "stderr
4Feb 7, 2026 05:543,43423,568,5921,007,0002,015,0002,277,376
5Feb 7, 2026 05:543,45316,836,4091,013,0002,026,0002,535,424
6Feb 7, 2026 05:543,46718,345,1301,017,0002,034,0002,502,656