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 9, 2026 17:54highload-churnerhighload-churnerScore: 11,163Success
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 9, 2026 18:0211,08820,268,1719,758,000024,576
2Oct 9, 2026 18:0211,10020,146,6919,768,000024,576
3Oct 9, 2026 18:0211,13420,205,8829,798,000028,672
4Oct 9, 2026 18:0211,15220,205,2809,814,000028,672
5Oct 9, 2026 18:0211,16320,157,0069,824,000024,576
6Oct 9, 2026 18:0211,16520,198,0969,826,000024,576
7Oct 9, 2026 18:0211,18420,797,0809,842,000024,576
8Oct 9, 2026 18:0211,20220,220,1669,858,000028,672
9Oct 9, 2026 18:0211,26820,509,6259,916,000024,576