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 2, 2026 03:41Victor MerckléVictor MerckléScore: 3,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 03:443,82911,681,6763,370,00002,117,632stderr
2Aug 2, 2026 03:443,90611,675,5523,438,00002,117,632stderr
3Aug 2, 2026 03:443,92212,096,6903,452,00002,117,632stderr
4Aug 2, 2026 03:443,92311,645,4583,453,00002,117,632stderr
5Aug 2, 2026 03:443,93011,675,3063,459,00002,117,632stderr
6Aug 2, 2026 03:443,93012,523,0153,459,00002,117,632stderr
7Aug 2, 2026 03:443,93911,608,6883,467,00002,117,632stderr
8Aug 2, 2026 03:443,94511,668,3583,472,00002,117,632stderr
9Aug 2, 2026 03:444,06011,812,8613,573,00002,117,632stderr