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 17, 2026 02:34zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 06:34M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:3408,441,9171,042,00002,113,536expected "6442459076 ", got "2305422625 "
2May 17, 2026 06:3408,557,2681,043,00002,113,536expected "6442459076 ", got "2305422625 "
3May 17, 2026 06:3409,590,6161,306,00002,113,536expected "6442459076 ", got "2305422625 "
4Jan 17, 2026 02:343,38218,301,7331,984,000992,0002,351,104
5Jan 17, 2026 02:343,40223,709,4531,996,000998,0002,347,008
6Jan 17, 2026 02:343,41020,459,8582,001,0001,000,0002,351,104