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 17, 2026 12:29Tomislav TunkovicTomislav TunkovicScore: 3,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 12:353,74211,532,0572,079,0001,214,00053,248
2Aug 17, 2026 12:353,75611,504,0832,257,0001,049,00053,248
3Aug 17, 2026 12:353,76211,544,5242,120,0001,191,00053,248
4Aug 17, 2026 12:353,79513,025,8712,285,0001,055,00053,248
5Aug 17, 2026 12:353,79811,577,7912,254,0001,089,00053,248
6Aug 17, 2026 12:353,80711,603,9792,298,0001,053,00053,248
7Aug 17, 2026 12:353,83011,535,8362,290,0001,081,00053,248
8Aug 17, 2026 12:353,86912,395,4962,350,0001,055,00053,248
9Aug 17, 2026 12:353,90611,558,2552,056,0001,382,00053,248