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:55highload-churnerhighload-churnerScore: 3,022Success
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:572,93111,311,7482,580,00002,113,536
2Oct 12, 2026 14:572,93511,350,2722,583,00002,113,536
3Oct 12, 2026 14:572,93511,219,6462,583,00002,113,536
4Oct 12, 2026 14:572,94811,245,5242,595,00002,113,536
5Oct 12, 2026 14:573,02211,902,2202,660,00002,113,536
6Oct 12, 2026 14:573,02211,257,8582,660,00002,113,536
7Oct 12, 2026 14:573,02711,818,2742,664,00002,113,536
8Oct 12, 2026 14:573,04311,302,4122,678,00002,113,536
9Oct 12, 2026 14:573,05011,795,1062,684,00002,113,536