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 11, 2026 06:09Victor MerckléVictor MerckléScore: 7,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 06:127,44313,930,9386,550,00002,113,536
2Jun 11, 2026 06:127,51413,823,3586,613,00002,113,536
3Jun 11, 2026 06:127,54314,136,5366,638,00002,113,536
4Jun 11, 2026 06:127,54314,338,3606,638,00002,113,536
5Jun 11, 2026 06:127,55014,197,0996,644,00002,113,536
6Jun 11, 2026 06:127,55913,854,4016,652,00002,113,536
7Jun 11, 2026 06:127,65114,436,3996,733,00002,113,536
8Jun 11, 2026 06:127,65113,949,3756,733,00002,113,536
9Jun 11, 2026 06:127,66113,922,6126,742,00002,113,536