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 29, 2026 13:23Victor MerckléVictor MerckléScore: 4,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 13:264,72311,930,6614,157,00002,113,536
2Jun 29, 2026 13:264,75211,896,2644,182,00002,113,536
3Jun 29, 2026 13:264,83111,928,3414,252,00002,113,536
4Jun 29, 2026 13:264,84211,952,3684,261,00002,113,536
5Jun 29, 2026 13:264,84611,930,3174,265,00002,113,536
6Jun 29, 2026 13:264,84811,952,5834,267,00002,113,536
7Jun 29, 2026 13:264,85512,261,4284,273,00002,113,536
8Jun 29, 2026 13:264,87811,941,3884,293,00002,113,536
9Jun 29, 2026 13:265,08712,208,6714,477,00002,113,536