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 20:14Victor MerckléVictor MerckléScore: 6,957Success
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 20:166,86913,534,6026,045,00002,113,536
2Jun 19, 2026 20:166,88113,571,4816,056,00002,113,536
3Jun 19, 2026 20:166,94013,544,0916,108,00002,113,536
4Jun 19, 2026 20:166,94213,803,6086,109,00002,113,536
5Jun 19, 2026 20:166,95713,547,6466,123,00002,113,536
6Jun 19, 2026 20:166,96013,842,6026,125,00002,113,536
7Jun 19, 2026 20:166,99713,924,6496,158,00002,113,536
8Jun 19, 2026 20:167,08513,625,8926,235,00002,113,536
9Jun 19, 2026 20:167,10513,700,9476,253,00002,113,536