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 listMar 28, 2026 09:55Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:16M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:45013,523,8832,635,00002,117,632expected "6442459076 ", got "11794192309 "
2May 17, 2026 14:45011,194,6732,630,00002,117,632expected "6442459076 ", got "11794192309 "
3May 17, 2026 14:45012,964,6202,565,00002,117,632expected "6442459076 ", got "11794192309 "
4Mar 28, 2026 09:5510,80026,459,0228,448,0001,056,0002,281,472
5Mar 28, 2026 09:5510,83421,013,6588,475,0001,059,0002,277,376
6Mar 28, 2026 09:5511,02535,146,9599,702,00002,400,256