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 23, 2026 03:59zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 06:52M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:5209,946,0671,124,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 06:52010,049,7721,111,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 06:52011,225,6711,120,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 23, 2026 03:593,35117,502,9271,966,000983,0002,355,200
5Jan 23, 2026 03:593,45518,888,4802,027,0001,013,0002,355,200
6Jan 23, 2026 03:593,47822,499,2612,041,0001,020,0002,347,008