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:35highload-churnerhighload-churnerScore: 4,461Success
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:374,39812,742,4692,434,0001,437,0002,113,536
2Oct 12, 2026 14:374,43712,844,6262,454,0001,451,0002,113,536
3Oct 12, 2026 14:374,44012,738,8892,465,0001,443,0002,113,536
4Oct 12, 2026 14:374,45512,839,6982,462,0001,459,0002,113,536
5Oct 12, 2026 14:374,46112,811,9822,465,0001,461,0002,113,536
6Oct 12, 2026 14:374,46112,873,6772,465,0001,461,0002,113,536
7Oct 12, 2026 14:374,51812,757,1732,549,0001,427,0002,113,536
8Oct 12, 2026 14:374,54712,807,8482,543,0001,459,0002,113,536
9Oct 12, 2026 14:374,61412,750,3441,947,0002,114,0002,113,536