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 listFeb 6, 2026 05:09vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 06:58M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:5809,342,8011,184,00002,113,536expected "6442459076 ", got " "
2May 17, 2026 06:5809,408,0901,197,00002,113,536expected "6442459076 ", got " "
3May 17, 2026 06:58010,962,4181,192,00002,113,536expected "6442459076 ", got " "
4Feb 6, 2026 05:093,45117,633,9771,012,0002,025,0002,494,464
5Feb 6, 2026 05:093,46722,294,2591,017,0002,034,0002,494,464
6Feb 6, 2026 05:093,55217,102,0311,042,0002,084,0002,535,424