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 15, 2026 19:09Tomislav TunkovicTomislav TunkovicScore: 2,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 19:112,66410,514,6362,345,000020,480
2Aug 15, 2026 19:112,66710,464,6192,347,000020,480
3Aug 15, 2026 19:112,67510,478,3772,354,000020,480
4Aug 15, 2026 19:112,68410,469,9492,362,000020,480
5Aug 15, 2026 19:112,68410,510,3762,362,000020,480
6Aug 15, 2026 19:112,68810,477,6272,366,000020,480
7Aug 15, 2026 19:112,68810,549,4312,366,000020,480
8Aug 15, 2026 19:112,71811,089,2142,392,000020,480
9Aug 15, 2026 19:112,73511,169,3262,407,000020,480