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 listJan 20, 2026 22:44Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:23M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:2509,822,2541,532,00002,117,632expected "6442459076 ", got "2147490633 "
2May 17, 2026 07:25010,932,4501,516,00002,117,632expected "6442459076 ", got "2147490633 "
3May 17, 2026 07:25010,053,1691,538,00002,117,632expected "6442459076 ", got "2147490633 "
4Jan 20, 2026 22:4411,23322,695,1916,920,0002,965,0002,523,136
5Jan 20, 2026 22:4411,28625,707,5748,939,000993,0002,277,376
6Jan 20, 2026 22:4411,29125,860,9908,943,000993,0002,281,472