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 19, 2026 19:50Victor MerckléVictor MerckléScore: 6,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 19:526,88113,577,6736,056,00002,113,536
2Jun 19, 2026 19:526,89413,584,8756,067,00002,113,536
3Jun 19, 2026 19:526,95013,578,4206,116,00002,113,536
4Jun 19, 2026 19:526,97013,619,2546,134,00002,113,536
5Jun 19, 2026 19:526,97813,874,2856,141,00002,113,536
6Jun 19, 2026 19:527,01116,303,6806,170,00002,113,536
7Jun 19, 2026 19:527,09213,702,7956,241,00002,113,536
8Jun 19, 2026 19:527,11914,018,8376,265,00002,113,536
9Jun 19, 2026 19:527,23913,896,8086,371,00002,113,536