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 20:00Victor MerckléVictor MerckléScore: 5,457Success
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 20:035,31412,241,8924,677,00002,113,536
2Jun 23, 2026 20:035,40912,274,9714,760,00002,113,536
3Jun 23, 2026 20:035,43712,632,9344,785,00002,113,536
4Jun 23, 2026 20:035,44512,288,0124,792,00002,113,536
5Jun 23, 2026 20:035,45712,597,8014,803,00002,113,536
6Jun 23, 2026 20:035,45912,356,7084,804,00002,113,536
7Jun 23, 2026 20:035,45912,659,6374,804,00002,113,536
8Jun 23, 2026 20:035,54212,411,9144,877,00002,113,536
9Jun 23, 2026 20:035,55412,375,6584,888,00002,113,536