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:37highload-churnerhighload-churnerScore: 12,010Success
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 22:2011,97520,915,56510,538,000020,480
2Oct 9, 2026 22:2011,99520,914,76710,556,000024,576
3Oct 9, 2026 22:2011,99720,939,05810,558,000024,576
4Oct 9, 2026 22:2012,00320,950,16210,563,000020,480
5Oct 9, 2026 22:2012,01020,945,76610,569,000020,480
6Oct 9, 2026 22:2012,01120,925,57510,570,000020,480
7Oct 9, 2026 22:2012,04620,932,19110,601,000024,576
8Oct 9, 2026 22:2012,07821,041,47710,629,000024,576
9Oct 9, 2026 22:2012,31721,768,20010,839,000020,480