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:18Yuriy 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:4308,495,6391,254,00002,121,728expected "6442459076 ", got "14817470418 "stderr
2May 17, 2026 08:4308,481,1731,210,00002,121,728expected "6442459076 ", got "14817470418 "stderr
3May 17, 2026 08:4309,444,4211,350,00002,121,728expected "6442459076 ", got "14817470418 "stderr
4Mar 20, 2026 17:1813,54127,355,0649,930,0001,986,0002,322,432
5Mar 20, 2026 17:1813,60529,122,7699,977,0001,995,0002,314,240
6Mar 20, 2026 17:1815,37228,414,42012,487,0001,040,0002,437,120