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:30highload-churnerhighload-churnerScore: 8,017Success
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:077,95417,491,1537,000,000020,480
2Oct 9, 2026 22:077,96817,366,7067,012,000028,672
3Oct 9, 2026 22:077,99517,549,1297,036,000028,672
4Oct 9, 2026 22:078,01417,529,4657,053,000028,672
5Oct 9, 2026 22:078,01717,483,9767,055,000020,480
6Oct 9, 2026 22:078,03117,465,7157,068,000028,672
7Oct 9, 2026 22:078,06317,551,4387,096,000028,672
8Oct 9, 2026 22:078,06517,919,7257,098,000028,672
9Oct 9, 2026 22:079,30618,663,2498,190,000032,768