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:40LatentSearchLatentSearchScore: 7,111Success
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:437,00614,332,9726,166,00002,113,536
2Aug 1, 2026 10:437,05614,306,8696,210,00002,113,536
3Aug 1, 2026 10:437,08714,246,5526,237,00002,113,536
4Aug 1, 2026 10:437,09614,230,8256,245,00002,113,536
5Aug 1, 2026 10:437,11114,283,9176,258,00002,113,536
6Aug 1, 2026 10:437,11815,668,1796,264,00002,113,536
7Aug 1, 2026 10:437,19514,369,0466,332,00002,113,536
8Aug 1, 2026 10:437,20314,377,2326,339,00002,113,536
9Aug 1, 2026 10:437,25314,343,9746,383,00002,113,536