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:23LatentSearchLatentSearchScore: 60,135Success
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:2659,77762,715,20150,472,0002,132,0002,113,536
2Jul 31, 2026 21:2660,04862,968,88650,680,0002,163,0002,113,536
3Jul 31, 2026 21:2660,06462,915,60550,716,0002,141,0002,113,536
4Jul 31, 2026 21:2660,13064,242,31850,760,0002,155,0002,113,536
5Jul 31, 2026 21:2660,13562,994,58250,784,0002,135,0002,113,536
6Jul 31, 2026 21:2660,14462,975,45050,783,0002,144,0002,113,536
7Jul 31, 2026 21:2660,15462,968,43450,736,0002,200,0002,113,536
8Jul 31, 2026 21:2660,30763,055,36750,943,0002,128,0002,113,536
9Jul 31, 2026 21:2660,53263,303,12451,144,0002,125,0002,113,536