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 22, 2026 04:40zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:07M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:07010,283,8641,193,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 07:07010,311,0421,102,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 07:0708,949,2861,174,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 22, 2026 04:403,41922,388,8562,006,0001,003,0002,535,424
5Jan 22, 2026 04:403,47723,313,4212,040,0001,020,0002,527,232
6Jan 22, 2026 04:403,66320,433,8731,074,0002,149,0002,433,024