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 07:44highload-churnerhighload-churnerScore: 2,426Success
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 07:472,38711,852,4712,101,000020,480
2Oct 13, 2026 07:472,39310,846,4782,106,000020,480
3Oct 13, 2026 07:472,40110,884,1722,113,000020,480
4Oct 13, 2026 07:472,42010,811,2102,130,000020,480
5Oct 13, 2026 07:472,42610,871,5092,135,000020,480
6Oct 13, 2026 07:472,44710,881,0562,154,000020,480
7Oct 13, 2026 07:472,47110,947,6182,175,000020,480
8Oct 13, 2026 07:472,47810,906,8332,181,000020,480
9Oct 13, 2026 07:472,70711,154,6072,383,000020,480