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 12:43Victor MerckléVictor MerckléScore: 5,269Success
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 12:465,13512,287,3974,519,00002,113,536
2Jun 29, 2026 12:465,15912,298,6794,540,00002,113,536
3Jun 29, 2026 12:465,24812,262,6174,619,00002,113,536
4Jun 29, 2026 12:465,26212,286,1824,631,00002,113,536
5Jun 29, 2026 12:465,26912,620,9904,637,00002,113,536
6Jun 29, 2026 12:465,27712,301,6064,644,00002,113,536
7Jun 29, 2026 12:465,56412,581,6694,897,00002,113,536
8Jun 29, 2026 12:465,67712,680,6574,996,00002,113,536
9Jun 29, 2026 12:465,71815,245,4735,032,00002,113,536