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 20, 2026 01:51zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 05:17M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 05:1708,419,3791,100,00002,113,536expected "6442459076 ", got "2305422362 "
2May 17, 2026 05:1708,195,5161,043,00002,113,536expected "6442459076 ", got "2305422362 "
3May 17, 2026 05:1709,180,5021,107,00002,113,536expected "6442459076 ", got "2305422362 "
4Feb 20, 2026 01:513,32020,636,6982,922,00002,433,024
5Feb 20, 2026 01:513,32319,957,2972,924,00002,535,424
6Feb 20, 2026 01:513,88021,714,7693,414,00002,424,832