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:21TudyMTudyMScore: 31,494Success
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:2431,34541,992,25326,518,0001,066,0002,367,488
2May 3, 2026 19:2431,36943,244,03126,520,0001,085,0002,375,680
3May 3, 2026 19:2431,37841,488,47826,520,0001,093,0002,371,584
4May 3, 2026 19:2431,45244,126,02726,633,0001,045,0002,383,872
5May 3, 2026 19:2431,49445,607,29626,621,0001,094,0002,375,680
6May 3, 2026 19:2431,51341,727,74426,644,0001,088,0002,367,488
7May 3, 2026 19:2431,81758,259,75626,906,0001,093,0002,355,200
8May 3, 2026 19:2431,88557,016,29326,947,0001,112,0002,375,680
9May 3, 2026 19:2432,02361,506,32327,085,0001,096,0002,363,392