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 listMay 3, 2026 20:41TudyMTudyMScore: 30,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:4529,96940,760,22825,320,0001,053,0002,342,912
2May 3, 2026 20:4529,97345,176,15025,321,0001,056,0002,310,144
3May 3, 2026 20:4530,00343,529,15425,339,0001,064,0002,330,624
4May 3, 2026 20:4530,03440,044,02525,367,0001,063,0002,326,528
5May 3, 2026 20:4530,04440,931,37925,368,0001,071,0002,318,336
6May 3, 2026 20:4530,12341,336,66325,428,0001,081,0002,322,432
7May 3, 2026 20:4530,15941,064,18025,463,0001,077,0002,330,624
8May 3, 2026 20:4530,20640,512,67925,499,0001,083,0002,322,432
9May 3, 2026 20:4530,22042,791,87525,522,0001,072,0002,330,624