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 listOct 12, 2026 14:44highload-churnerhighload-churnerScore: 3,088Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 13, 2026 12:08Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 14:463,06911,331,7032,701,00002,113,536
2Oct 12, 2026 14:463,07311,397,1202,705,00002,113,536
3Oct 12, 2026 14:463,07611,868,9262,707,00002,113,536
4Oct 12, 2026 14:463,08811,427,1022,718,00002,113,536
5Oct 12, 2026 14:463,08811,614,7492,718,00002,113,536
6Oct 12, 2026 14:463,09311,400,9702,722,00002,113,536
7Oct 12, 2026 14:463,10611,403,8782,734,00002,113,536
8Oct 12, 2026 14:463,17612,989,2962,795,00002,113,536
9Oct 12, 2026 14:463,24811,607,8982,859,00002,113,536