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 5, 2026 23:27vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 13:27M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 13:4909,117,6881,212,00002,117,632expected "6442459076 ", got " "stderr
2May 17, 2026 13:49010,382,6681,209,00002,117,632expected "6442459076 ", got " "stderr
3May 17, 2026 13:4909,139,4841,194,00002,117,632expected "6442459076 ", got " "stderr
4Feb 5, 2026 23:273,47219,172,5661,018,0002,037,0002,498,560
5Feb 5, 2026 23:273,51517,352,3291,031,0002,062,0002,490,368
6Feb 5, 2026 23:273,56718,599,8721,046,0002,093,0002,277,376