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 listAug 25, 2026 17:55Oleg KovalovOleg KovalovScore: 7,381,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 17:597,331,0476,462,045,1226,450,322,0001,000,0002,113,536
2Aug 25, 2026 17:597,347,8156,476,103,3106,465,078,0001,000,0002,113,536
3Aug 25, 2026 17:597,349,5476,477,659,9246,466,601,0001,001,0002,113,536
4Aug 25, 2026 17:597,365,5346,491,868,4566,479,556,0002,114,0002,113,536
5Aug 25, 2026 17:597,381,4786,506,585,4896,493,602,0002,099,0002,113,536
6Aug 25, 2026 17:597,390,6896,515,168,6336,502,805,0001,002,0002,113,536
7Aug 25, 2026 17:597,405,4736,527,604,9816,513,768,0003,049,0002,113,536
8Aug 25, 2026 17:597,412,1696,532,770,8076,521,707,0001,002,0002,113,536
9Aug 25, 2026 17:597,416,0296,536,148,9726,525,106,0001,000,0002,113,536