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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 08:45M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:45010,576,5451,438,00002,121,728expected "6442459076 ", got "14817470418 "stderr
2May 17, 2026 08:45011,075,2041,451,00002,121,728expected "6442459076 ", got "14817470418 "stderr
3May 17, 2026 08:45011,692,08402,353,0002,121,728expected "6442459076 ", got "14817470418 "stderr
4Mar 20, 2026 17:1714,65941,641,74610,916,0001,984,0002,465,792
5Mar 20, 2026 17:1714,77543,402,59511,002,0002,000,0002,408,448
6Mar 20, 2026 17:1714,84944,114,56911,057,0002,010,0002,273,280