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 26, 2026 23:21zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:15M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:15010,349,6701,128,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 07:1509,221,7411,122,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 07:1509,013,4541,115,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 26, 2026 23:213,47720,613,2582,040,0001,020,0002,355,200
5Jan 26, 2026 23:213,49922,554,6472,053,0001,026,0002,277,376
6Jan 26, 2026 23:213,53518,991,8372,074,0001,037,0002,351,104