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 listApr 8, 2026 04:37olliecrowolliecrowScore: 14,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 04:3714,81531,516,13812,035,0001,002,0002,416,640
2Apr 8, 2026 04:3714,81929,057,30112,038,0001,003,0002,277,376
3Apr 8, 2026 04:3714,82735,812,54612,045,0001,003,0002,523,136
4Apr 8, 2026 04:3714,92231,000,69611,111,0002,020,0002,527,232
5Apr 8, 2026 04:3714,99129,359,39612,178,0001,014,0002,359,296
6Apr 8, 2026 04:3714,99430,257,35211,165,0002,030,0002,482,176
7Apr 8, 2026 04:3715,00532,718,66611,173,0002,031,0002,277,376
8Apr 8, 2026 04:3715,04734,642,99912,223,0001,018,0002,416,640
9Apr 8, 2026 04:3715,05935,691,57212,233,0001,019,0002,527,232