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 04:06highload-churnerhighload-churnerScore: 2,419Success
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 04:112,39010,791,0402,104,000020,480
2Oct 13, 2026 04:112,40710,770,7172,119,000020,480
3Oct 13, 2026 04:112,41010,779,9672,121,000020,480
4Oct 13, 2026 04:112,41510,823,9562,126,000020,480
5Oct 13, 2026 04:112,41910,746,0062,129,000020,480
6Oct 13, 2026 04:112,42010,729,9182,130,000020,480
7Oct 13, 2026 04:112,42311,350,1042,133,000020,480
8Oct 13, 2026 04:112,43610,789,4102,144,000020,480
9Oct 13, 2026 04:112,48010,808,9782,183,000020,480