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 13, 2026 02:56highload-churnerhighload-churnerScore: 2,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 02:582,61311,103,0402,300,00002,113,536
2Oct 13, 2026 02:582,62611,005,4692,311,00002,113,536
3Oct 13, 2026 02:582,63011,128,0682,315,00002,113,536
4Oct 13, 2026 02:582,63710,998,1612,321,00002,113,536
5Oct 13, 2026 02:582,64611,095,0122,329,00002,113,536
6Oct 13, 2026 02:582,75111,191,4412,421,00002,113,536
7Oct 13, 2026 02:582,75211,128,2042,422,00002,113,536
8Oct 13, 2026 02:582,75911,036,5402,428,00002,113,536
9Oct 13, 2026 02:582,76511,140,4652,434,00002,113,536