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 11:41Tomislav TunkovicTomislav TunkovicScore: 3,395Success
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 11:433,37712,203,2942,972,000020,480
2Aug 15, 2026 11:433,38011,066,5802,975,000020,480
3Aug 15, 2026 11:433,38510,990,6962,979,000020,480
4Aug 15, 2026 11:433,38510,858,5312,979,000020,480
5Aug 15, 2026 11:433,39510,914,7352,988,000020,480
6Aug 15, 2026 11:433,39712,376,8262,990,000020,480
7Aug 15, 2026 11:433,39811,028,8702,991,000020,480
8Aug 15, 2026 11:433,41211,460,6773,003,000020,480
9Aug 15, 2026 11:433,41311,089,7443,004,000020,480