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:42TudyMTudyMScore: 31,234Success
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:4531,12043,860,36326,329,0001,057,0002,367,488
2May 3, 2026 19:4531,18743,767,49526,389,0001,056,0002,375,680
3May 3, 2026 19:4531,19041,837,91526,382,0001,066,0002,367,488
4May 3, 2026 19:4531,21944,225,34926,398,0001,075,0002,367,488
5May 3, 2026 19:4531,23441,666,29726,422,0001,064,0002,379,776
6May 3, 2026 19:4531,23743,061,05726,426,0001,063,0002,379,776
7May 3, 2026 19:4531,24443,462,06726,412,0001,083,0002,371,584
8May 3, 2026 19:4531,26242,517,73526,434,0001,077,0002,379,776
9May 3, 2026 19:4531,29244,459,91626,477,0001,060,0002,371,584