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 listJan 27, 2026 13:43SemyonSemyonScore: 1,070,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2026 13:431,066,832966,446,063936,813,0001,999,0002,265,088
2Jan 27, 2026 13:431,066,986964,253,503937,949,000999,0002,490,368
3Jan 27, 2026 13:431,067,210961,465,033938,145,0001,000,0002,265,088
4Jan 27, 2026 13:431,069,331969,346,641939,011,0002,000,0002,473,984
5Jan 27, 2026 13:431,070,668971,447,864941,188,0001,000,0002,494,464
6Jan 27, 2026 13:431,071,120973,349,061940,587,0001,999,0002,293,760
7Jan 27, 2026 13:431,073,389974,152,517941,584,0002,998,0002,265,088
8Jan 27, 2026 13:431,075,344978,509,052944,303,0002,000,0002,269,184
9Jan 27, 2026 13:431,075,610969,462,823944,538,0001,999,0002,269,184