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 18:05Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 08:43M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:4409,835,4032,104,00002,121,728expected "6442459076 ", got "14817470387 "stderr
2May 17, 2026 08:4409,463,5752,234,00002,121,728expected "6442459076 ", got "14817470387 "stderr
3May 17, 2026 08:4409,875,5522,175,00002,121,728expected "6442459076 ", got "14817470387 "stderr
4Mar 20, 2026 18:0513,69429,187,49610,043,0002,008,0002,527,232
5Mar 20, 2026 18:0514,01627,258,03010,279,0002,055,0002,301,952
6Mar 20, 2026 18:0514,04128,035,44611,327,0001,029,0002,527,232