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:35TudyMTudyMScore: 31,093Success
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:3930,98444,601,28726,196,0001,070,0002,379,776
2May 3, 2026 19:3931,02040,715,08026,244,0001,054,0002,375,680
3May 3, 2026 19:3931,05944,142,75326,264,0001,068,0002,379,776
4May 3, 2026 19:3931,08541,114,10426,282,0001,073,0002,371,584
5May 3, 2026 19:3931,09340,848,31626,285,0001,077,0002,363,392
6May 3, 2026 19:3931,10443,137,23526,304,0001,068,0002,367,488
7May 3, 2026 19:3931,13743,500,72826,330,0001,071,0002,367,488
8May 3, 2026 19:3931,17340,950,07726,366,0001,067,0002,367,488
9May 3, 2026 19:3931,25343,694,90826,449,0001,054,0002,363,392