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 listApr 28, 2026 09:39TudyMTudyMScore: 70,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:4070,22880,696,19559,808,0001,993,0002,371,584
2Apr 28, 2026 09:4070,32583,852,60059,890,0001,996,0002,326,528
3Apr 28, 2026 09:4070,54885,074,77959,079,0003,004,0002,326,528
4Apr 28, 2026 09:4070,55777,545,78859,087,0003,004,0002,375,680
5Apr 28, 2026 09:4070,62282,241,61262,148,00002,375,680
6Apr 28, 2026 09:4070,68280,799,84059,192,0003,009,0002,359,296
7Apr 28, 2026 09:4070,69683,713,91261,210,0001,003,0002,326,528
8Apr 28, 2026 09:4070,74280,258,02661,249,0001,004,0002,371,584
9Apr 28, 2026 09:4070,78483,011,66761,286,0001,004,0002,326,528