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 23:42vahookvahookScore: 4,759Success
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 23:424,71618,215,3292,075,0002,075,0002,277,376
2Jan 13, 2026 23:424,72720,432,9572,080,0002,080,0002,277,376
3Jan 13, 2026 23:424,75020,050,8782,090,0002,090,0002,498,560
4Jan 13, 2026 23:424,75722,549,4572,093,0002,093,0002,494,464
5Jan 13, 2026 23:424,75919,658,5082,094,0002,094,0002,498,560
6Jan 13, 2026 23:424,75923,043,4552,094,0002,094,0002,277,376
7Jan 13, 2026 23:424,75925,178,6142,094,0002,094,0002,277,376
8Jan 13, 2026 23:424,76823,506,9892,098,0002,098,0002,494,464
9Jan 13, 2026 23:424,92318,701,8273,249,0001,083,0002,277,376