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 listApr 24, 2026 15:25Victor MerckléVictor MerckléScore: 13,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 15:2713,56831,438,1227,960,0003,980,0002,523,136
2Apr 24, 2026 15:2713,65431,536,6658,011,0004,005,0002,527,232
3Apr 24, 2026 15:2713,71532,427,7498,047,0004,023,0002,527,232
4Apr 24, 2026 15:2713,72525,986,7728,052,0004,026,0002,351,104
5Apr 24, 2026 15:2713,72833,576,4358,054,0004,027,0002,367,488
6Apr 24, 2026 15:2713,72928,756,6588,055,0004,027,0002,486,272
7Apr 24, 2026 15:2713,73632,724,3358,059,0004,029,0002,527,232
8Apr 24, 2026 15:2713,73831,030,2278,060,0004,030,0002,535,424
9Apr 24, 2026 15:2713,82726,844,4818,112,0004,056,0002,531,328