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 20, 2026 17:34Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 08:37M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:3908,883,1531,765,00002,121,728expected "6442459076 ", got "14817470387 "stderr
2May 17, 2026 08:39011,313,2672,730,00002,121,728expected "6442459076 ", got "14817470387 "stderr
3May 17, 2026 08:3909,934,5201,704,00002,121,728expected "6442459076 ", got "14817470387 "stderr
4Mar 20, 2026 17:3412,48829,856,0528,991,0001,998,0002,531,328
5Mar 20, 2026 17:3412,57727,567,10310,062,0001,006,0002,326,528
6Mar 20, 2026 17:3412,66926,219,37010,136,0001,013,0002,314,240