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 listFeb 11, 2026 01:57zielajzielajScore: 3,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 01:583,32519,834,4412,926,00002,408,448
2Feb 11, 2026 01:573,46023,729,3352,030,0001,015,0002,412,544
3Feb 11, 2026 01:583,46120,287,0222,031,0001,015,0002,408,448
4Feb 11, 2026 01:583,47216,402,4422,037,0001,018,0002,527,232
5Feb 11, 2026 01:583,49918,605,5052,053,0001,026,0002,277,376
6Feb 11, 2026 01:583,50624,702,2892,057,0001,028,0002,404,352
7Feb 11, 2026 01:573,68220,565,0302,160,0001,080,0002,396,160
8Feb 11, 2026 01:573,70620,571,8572,174,0001,087,0002,404,352
9Feb 11, 2026 01:584,46417,409,3243,928,00002,400,256