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 06:04Victor MerckléVictor MerckléScore: 5,938Success
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 06:065,82012,669,3685,122,00002,113,536
2Jun 23, 2026 06:065,83714,106,6335,137,00002,113,536
3Jun 23, 2026 06:065,85712,666,5695,155,00002,113,536
4Jun 23, 2026 06:065,91912,685,3655,209,00002,113,536
5Jun 23, 2026 06:065,93813,013,2405,226,00002,113,536
6Jun 23, 2026 06:065,94313,067,4455,230,00002,113,536
7Jun 23, 2026 06:065,94712,714,0725,234,00002,113,536
8Jun 23, 2026 06:065,96012,686,9575,245,00002,113,536
9Jun 23, 2026 06:066,23713,001,2685,489,00002,113,536