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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 13:21M-Rochat12.43CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 13:43011,530,25301,574,0002,121,728expected "6442459076 ", got "14817470418 "stderr
2May 17, 2026 13:43010,774,9441,537,00002,121,728expected "6442459076 ", got "14817470418 "stderr
3May 17, 2026 13:43011,784,86701,583,0002,121,728expected "6442459076 ", got "14817470418 "stderr
4Mar 20, 2026 17:0915,53645,122,93512,621,0001,051,0002,519,040
5Mar 20, 2026 17:0915,59347,625,82212,742,000980,0002,519,040
6Mar 20, 2026 17:0915,68963,185,40713,806,00002,490,368