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 08:47Victor MerckléVictor MerckléScore: 5,927Success
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 08:505,85212,698,0325,150,00002,113,536
2Jun 23, 2026 08:505,88912,665,5705,183,00002,113,536
3Jun 23, 2026 08:505,91112,629,8895,202,00002,113,536
4Jun 23, 2026 08:505,91212,633,1835,203,00002,113,536
5Jun 23, 2026 08:505,92712,656,4595,216,00002,113,536
6Jun 23, 2026 08:505,92913,015,5475,218,00002,113,536
7Jun 23, 2026 08:505,93112,649,6005,220,00002,113,536
8Jun 23, 2026 08:505,93513,025,0835,223,00002,113,536
9Jun 23, 2026 08:506,21712,972,1565,471,00002,113,536