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 1, 2026 10:18LatentSearchLatentSearchScore: 7,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 10:207,26215,249,5186,391,00002,113,536
2Aug 1, 2026 10:207,26415,361,2736,393,00002,113,536
3Aug 1, 2026 10:207,27315,324,1746,401,00002,113,536
4Aug 1, 2026 10:207,28914,751,4726,415,00002,113,536
5Aug 1, 2026 10:207,29215,356,4206,417,00002,113,536
6Aug 1, 2026 10:207,32315,385,1126,445,00002,113,536
7Aug 1, 2026 10:207,34314,783,2916,462,00002,113,536
8Aug 1, 2026 10:207,35115,400,1096,469,00002,113,536
9Aug 1, 2026 10:207,42714,901,8796,536,00002,113,536