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 12, 2026 16:36highload-churnerhighload-churnerScore: 2,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 16:392,71211,202,0372,387,00002,113,536
2Oct 12, 2026 16:392,71711,113,3882,391,00002,113,536
3Oct 12, 2026 16:392,71811,153,8532,392,00002,113,536
4Oct 12, 2026 16:392,72111,115,8012,395,00002,113,536
5Oct 12, 2026 16:392,73511,084,2392,407,00002,113,536
6Oct 12, 2026 16:392,73611,157,1402,408,00002,113,536
7Oct 12, 2026 16:392,73711,160,6542,409,00002,113,536
8Oct 12, 2026 16:392,75111,159,0042,421,00002,113,536
9Oct 12, 2026 16:392,86011,270,0542,517,00002,113,536