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 9, 2026 16:54highload-churnerhighload-churnerScore: 12,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 17:0412,36421,245,69310,881,000020,480
2Oct 9, 2026 17:0412,43421,914,75010,942,000020,480
3Oct 9, 2026 17:0412,47521,956,34310,978,000020,480
4Oct 9, 2026 17:0412,47722,016,69110,980,000020,480
5Oct 9, 2026 17:0412,48921,457,54110,991,000024,576
6Oct 9, 2026 17:0412,49421,532,36710,995,000020,480
7Oct 9, 2026 17:0412,50922,037,03411,008,000020,480
8Oct 9, 2026 17:0412,51522,791,09411,014,000020,480
9Oct 9, 2026 17:0412,53721,427,40711,033,000020,480