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 00:44vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:15M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:1508,622,8501,212,00002,113,536expected "6442459076 ", got "2147491783 "
2May 17, 2026 07:1509,964,0671,202,00002,113,536expected "6442459076 ", got "2147491783 "
3May 17, 2026 07:1509,577,5001,195,00002,113,536expected "6442459076 ", got "2147491783 "
4Feb 5, 2026 00:443,49123,684,4361,024,0002,048,0002,281,472
5Feb 5, 2026 00:443,49221,402,8291,024,0002,049,0002,277,376
6Feb 5, 2026 00:443,56417,631,6741,045,0002,091,0002,494,464