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:39M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:39010,436,6711,426,00002,117,632expected "6442459076 ", got "2147484215 "
2May 17, 2026 08:3908,785,7981,457,00002,117,632expected "6442459076 ", got "2147484215 "
3May 17, 2026 08:39010,278,0341,451,00002,117,632expected "6442459076 ", got "2147484215 "
4Jan 20, 2026 22:4412,06428,304,4289,555,0001,061,0002,523,136
5Jan 20, 2026 22:4412,15026,778,1459,623,0001,069,0002,281,472
6Jan 20, 2026 22:4412,43529,525,8118,954,0001,989,0002,535,424