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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 08:40M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:41010,366,7581,652,00002,125,824expected "6442459076 ", got "14817477429 "stderr
2May 17, 2026 08:4108,906,9281,672,00002,121,728expected "6442459076 ", got "14817477429 "stderr
3May 17, 2026 08:41010,474,5021,751,00002,125,824expected "6442459076 ", got "14817477429 "stderr
4Mar 20, 2026 18:2512,99828,347,16510,399,0001,039,0002,445,312
5Mar 20, 2026 18:2513,53529,819,71810,919,000992,0002,347,008
6Mar 20, 2026 18:2513,54432,516,60510,926,000993,0002,449,408