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 22:20highload-churnerhighload-churnerScore: 6,418Success
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 23:366,38516,282,0025,619,000028,672
2Oct 9, 2026 23:366,39216,029,0395,625,000028,672
3Oct 9, 2026 23:366,40015,954,7025,632,000028,672
4Oct 9, 2026 23:366,41415,986,7145,645,000028,672
5Oct 9, 2026 23:366,41816,194,8685,648,000028,672
6Oct 9, 2026 23:366,42816,096,8595,657,000028,672
7Oct 9, 2026 23:366,44316,575,0215,670,000028,672
8Oct 9, 2026 23:366,48816,782,0775,710,000028,672
9Oct 9, 2026 23:366,48916,758,1935,711,000028,672