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:13highload-churnerhighload-churnerScore: 3,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 14:163,35211,674,0781,474,0001,476,0002,113,536
2Oct 12, 2026 14:163,36211,751,7501,467,0001,492,0002,113,536
3Oct 12, 2026 14:163,37511,685,4921,462,0001,508,0002,113,536
4Oct 12, 2026 14:163,37611,673,9851,480,0001,491,0002,113,536
5Oct 12, 2026 14:163,37711,712,5721,479,0001,493,0002,113,536
6Oct 12, 2026 14:163,38211,698,4091,477,0001,500,0002,113,536
7Oct 12, 2026 14:163,38211,693,4991,478,0001,499,0002,113,536
8Oct 12, 2026 14:163,39611,698,1261,458,0001,531,0002,113,536
9Oct 12, 2026 14:163,49611,760,0951,444,0001,633,0002,113,536