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 19:06TudyMTudyMScore: 31,660Success
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 19:0931,60543,595,25726,751,0001,062,0002,379,776
2May 3, 2026 19:0931,61241,805,07526,753,0001,066,0002,383,872
3May 3, 2026 19:0931,62144,817,37426,748,0001,079,0002,379,776
4May 3, 2026 19:0931,64241,688,08526,774,0001,071,0002,371,584
5May 3, 2026 19:0931,66042,077,56526,795,0001,066,0002,375,680
6May 3, 2026 19:0931,67644,480,76826,819,0001,056,0002,371,584
7May 3, 2026 19:0931,67844,129,54026,815,0001,062,0002,367,488
8May 3, 2026 19:0931,72743,891,53626,848,0001,072,0002,371,584
9May 3, 2026 19:0931,77944,546,31426,903,0001,063,0002,371,584