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 13, 2026 03:38highload-churnerhighload-churnerScore: 2,652Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 03:402,62611,111,8592,311,00002,113,536
2Oct 13, 2026 03:402,64711,166,9142,330,00002,113,536
3Oct 13, 2026 03:402,64711,064,9612,330,00002,113,536
4Oct 13, 2026 03:402,65011,108,5742,332,00002,113,536
5Oct 13, 2026 03:402,65212,775,0092,334,00002,113,536
6Oct 13, 2026 03:402,65911,035,4002,340,00002,113,536
7Oct 13, 2026 03:402,66111,122,2872,342,00002,113,536
8Oct 13, 2026 03:402,68219,040,4612,361,00002,113,536
9Oct 13, 2026 03:402,74211,185,2822,413,00002,113,536