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 listJan 13, 2026 03:42vahookvahookScore: 4,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 03:424,94224,231,0543,262,0001,087,0002,277,376
2Jan 13, 2026 03:424,96121,603,1273,275,0001,091,0002,490,368
3Jan 13, 2026 03:424,96617,493,7403,278,0001,092,0002,277,376
4Jan 13, 2026 03:424,96922,148,6963,280,0001,093,0002,490,368
5Jan 13, 2026 03:424,98426,444,8523,290,0001,096,0002,277,376
6Jan 13, 2026 03:424,98420,549,3533,290,0001,096,0002,486,272
7Jan 13, 2026 03:424,99725,024,8223,298,0001,099,0002,498,560
8Jan 13, 2026 03:424,99817,511,8123,299,0001,099,0002,281,472
9Jan 13, 2026 03:425,01120,046,8593,308,0001,102,0002,281,472