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 listJul 31, 2026 21:19LatentSearchLatentSearchScore: 61,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 21:2260,88463,682,25551,453,0002,125,0002,113,536
2Jul 31, 2026 21:2261,09363,780,60551,721,0002,041,0002,113,536
3Jul 31, 2026 21:2261,12963,853,73451,629,0002,165,0002,113,536
4Jul 31, 2026 21:2261,15767,840,31251,609,0002,210,0002,113,536
5Jul 31, 2026 21:2261,16563,881,21551,689,0002,137,0002,113,536
6Jul 31, 2026 21:2261,20263,872,85151,719,0002,139,0002,113,536
7Jul 31, 2026 21:2261,21063,850,24751,725,0002,140,0002,113,536
8Jul 31, 2026 21:2261,35264,765,76251,903,0002,087,0002,113,536
9Jul 31, 2026 21:2261,37864,073,17351,949,0002,064,0002,113,536