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 03:47highload-churnerhighload-churnerScore: 2,637Success
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 03:492,62310,994,5482,309,00002,113,536
2Oct 13, 2026 03:492,62611,098,0162,311,00002,113,536
3Oct 13, 2026 03:492,62611,050,7602,311,00002,113,536
4Oct 13, 2026 03:492,63211,018,7072,317,00002,113,536
5Oct 13, 2026 03:492,63711,094,3292,321,00002,113,536
6Oct 13, 2026 03:492,73711,105,0542,409,00002,113,536
7Oct 13, 2026 03:492,73911,160,0682,411,00002,113,536
8Oct 13, 2026 03:492,75111,511,9602,421,00002,113,536
9Oct 13, 2026 03:492,98011,358,3372,623,00002,113,536