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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 08:42M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:42010,332,8451,191,00002,121,728expected "6442459076 ", got "14817470418 "stderr
2May 17, 2026 08:4208,976,8081,325,00002,121,728expected "6442459076 ", got "14817470418 "stderr
3May 17, 2026 08:4209,025,7461,324,00002,121,728expected "6442459076 ", got "14817470418 "stderr
4Mar 20, 2026 17:3513,56530,266,63510,943,000994,0002,326,528
5Mar 20, 2026 17:3513,56926,197,3228,956,0002,985,0002,318,336
6Mar 20, 2026 17:3513,64326,777,18410,005,0002,001,0002,379,776