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 24, 2026 03:17Andrew EpsteinAndrew EpsteinScore: 6,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 03:206,79015,789,8864,882,0001,094,0002,117,632
2Aug 24, 2026 03:206,85915,670,9514,862,0001,174,0002,117,632
3Aug 24, 2026 03:206,87615,785,9244,869,0001,182,0002,117,632
4Aug 24, 2026 03:206,88915,691,0414,890,0001,173,0002,117,632
5Aug 24, 2026 03:206,90615,565,9004,884,0001,194,0002,117,632
6Aug 24, 2026 03:206,91716,050,8674,893,0001,194,0002,117,632
7Aug 24, 2026 03:206,92615,684,9664,914,0001,181,0002,117,632
8Aug 24, 2026 03:206,93215,784,7714,911,0001,190,0002,117,632
9Aug 24, 2026 03:207,11915,921,7005,169,0001,096,0002,117,632