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 22:10vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:18M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:1808,765,1021,201,00002,113,536expected "6442459076 ", got " "
2May 17, 2026 07:1808,723,0671,265,00002,113,536expected "6442459076 ", got " "
3May 17, 2026 07:1809,409,5091,184,00002,113,536expected "6442459076 ", got " "
4Feb 5, 2026 22:103,47419,241,2981,019,0002,038,0002,498,560
5Feb 5, 2026 22:113,47720,060,9241,020,0002,040,0002,498,560
6Feb 5, 2026 22:113,49920,553,1821,026,0002,053,0002,498,560
7Feb 5, 2026 22:103,50115,845,7991,027,0002,054,0002,277,376
8Feb 5, 2026 22:113,53624,995,0461,037,0002,075,0002,498,560
9Feb 5, 2026 22:103,66319,254,6321,074,0002,149,0002,535,424