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 12:50highload-churnerhighload-churnerScore: 24,487Success
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 12:5524,40131,648,86021,473,000020,480
2Oct 9, 2026 12:5524,46731,739,26221,531,000020,480
3Oct 9, 2026 12:5524,47131,784,10221,535,000020,480
4Oct 9, 2026 12:5524,48031,667,04821,543,000020,480
5Oct 9, 2026 12:5524,48731,754,68621,549,000020,480
6Oct 9, 2026 12:5524,48831,722,44521,550,000020,480
7Oct 9, 2026 12:5524,55431,788,13121,608,000020,480
8Oct 9, 2026 12:5524,55931,780,89321,612,000020,480
9Oct 9, 2026 12:5524,58131,852,74421,632,000020,480