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 21:19highload-churnerhighload-churnerScore: 8,770Success
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 21:388,67218,023,3247,632,000028,672
2Oct 9, 2026 21:388,68418,020,5247,642,000028,672
3Oct 9, 2026 21:388,72318,100,8037,677,000028,672
4Oct 9, 2026 21:388,76318,291,0367,712,000028,672
5Oct 9, 2026 21:388,77018,072,4187,718,000028,672
6Oct 9, 2026 21:388,78018,671,7657,727,000028,672
7Oct 9, 2026 21:388,82518,742,5967,766,000028,672
8Oct 9, 2026 21:388,82618,799,9827,767,000028,672
9Oct 9, 2026 21:388,95518,283,8857,881,000028,672