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:40highload-churnerhighload-churnerScore: 6,481Success
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:286,44416,109,9765,671,000028,672
2Oct 9, 2026 22:286,46816,084,0955,692,000028,672
3Oct 9, 2026 22:286,47116,049,1305,695,000028,672
4Oct 9, 2026 22:286,47316,105,0315,697,000028,672
5Oct 9, 2026 22:286,48116,057,5255,704,000028,672
6Oct 9, 2026 22:286,49816,188,6515,719,000028,672
7Oct 9, 2026 22:286,50217,531,6935,722,000028,672
8Oct 9, 2026 22:286,50516,046,8535,725,000028,672
9Oct 9, 2026 22:287,15617,308,7666,298,000028,672