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 listJun 23, 2026 19:53Victor MerckléVictor MerckléScore: 5,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 19:565,67612,487,1934,995,00002,113,536
2Jun 23, 2026 19:565,75412,540,2445,064,00002,113,536
3Jun 23, 2026 19:565,75612,709,0325,066,00002,113,536
4Jun 23, 2026 19:565,76412,529,7285,073,00002,113,536
5Jun 23, 2026 19:565,76712,515,0235,075,00002,113,536
6Jun 23, 2026 19:565,77012,535,7165,078,00002,113,536
7Jun 23, 2026 19:565,77012,556,1105,078,00002,113,536
8Jun 23, 2026 19:565,79512,587,1995,100,00002,113,536
9Jun 23, 2026 19:565,82112,975,0005,123,00002,113,536