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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:44M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:44012,133,7851,687,00002,121,728expected "6442459076 ", got "14817477429 "stderr
2May 17, 2026 07:44010,671,2421,699,00002,121,728expected "6442459076 ", got "14817477429 "stderr
3May 17, 2026 07:4408,807,6731,591,00002,121,728expected "6442459076 ", got "14817477429 "stderr
4Mar 20, 2026 19:1611,38628,917,3248,016,0002,004,0002,424,832
5Mar 20, 2026 19:1211,39224,822,4749,023,0001,002,0002,269,184
6Mar 20, 2026 19:1211,39924,591,8958,025,0002,006,0002,428,928
7Mar 20, 2026 19:1211,43826,132,1449,059,0001,006,0002,424,832
8Mar 20, 2026 19:1611,45724,428,6088,066,0002,016,0002,519,040
9Mar 20, 2026 19:1611,51828,532,2559,123,0001,013,0002,531,328