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 20, 2026 22:44Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 08:36M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:36011,346,3891,414,00002,117,632expected "6442459076 ", got "2147490633 "
2May 17, 2026 08:36010,956,4721,426,00002,117,632expected "6442459076 ", got "2147490633 "
3May 17, 2026 08:3609,797,5921,516,00002,117,632expected "6442459076 ", got "2147490633 "
4Jan 20, 2026 22:4411,54226,972,5489,142,0001,015,0002,269,184
5Jan 20, 2026 22:4411,59127,487,2058,160,0002,040,0002,277,376
6Jan 20, 2026 22:4411,67529,761,3737,192,0003,082,0002,531,328