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:16highload-churnerhighload-churnerScore: 6,428Success
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:226,36916,673,2975,605,000028,672
2Oct 9, 2026 23:226,41316,634,6465,644,000028,672
3Oct 9, 2026 23:226,41316,607,9565,644,000028,672
4Oct 9, 2026 23:226,41916,624,2365,649,000028,672
5Oct 9, 2026 23:226,42816,660,4215,657,000028,672
6Oct 9, 2026 23:226,46116,669,6125,686,000028,672
7Oct 9, 2026 23:226,50416,762,5525,724,000028,672
8Oct 9, 2026 23:226,52317,561,9175,741,000028,672
9Oct 9, 2026 23:226,67516,270,2114,627,0001,247,00028,672