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 03:31highload-churnerhighload-churnerScore: 2,650Success
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 03:342,62611,043,8992,311,00002,113,536
2Oct 13, 2026 03:342,62914,084,8832,314,00002,113,536
3Oct 13, 2026 03:342,63711,182,6392,321,00002,113,536
4Oct 13, 2026 03:342,64211,037,6692,325,00002,113,536
5Oct 13, 2026 03:342,65011,151,9412,332,00002,113,536
6Oct 13, 2026 03:342,65111,187,9762,333,00002,113,536
7Oct 13, 2026 03:342,65311,047,4142,335,00002,113,536
8Oct 13, 2026 03:342,74612,445,4982,417,00002,113,536
9Oct 13, 2026 03:342,74611,169,4942,417,00002,113,536