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:03highload-churnerhighload-churnerScore: 2,739Success
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:062,62811,123,8542,313,00002,113,536
2Oct 13, 2026 03:062,64011,073,7442,324,00002,113,536
3Oct 13, 2026 03:062,65012,075,1382,332,00002,113,536
4Oct 13, 2026 03:062,67511,078,2902,354,00002,113,536
5Oct 13, 2026 03:062,73911,080,7412,411,00002,113,536
6Oct 13, 2026 03:062,74611,195,4732,417,00002,113,536
7Oct 13, 2026 03:062,76212,023,9192,431,00002,113,536
8Oct 13, 2026 03:062,76311,133,7032,432,00002,113,536
9Oct 13, 2026 03:062,76811,798,0852,436,00002,113,536