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:52TudyMTudyMScore: 30,405Success
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:5530,17340,458,42425,503,0001,050,0002,371,584
2May 3, 2026 19:5530,31041,259,80525,598,0001,075,0002,371,584
3May 3, 2026 19:5530,32340,691,12325,632,0001,053,0002,363,392
4May 3, 2026 19:5530,35042,709,33325,630,0001,078,0002,363,392
5May 3, 2026 19:5530,40540,665,44325,675,0001,082,0002,375,680
6May 3, 2026 19:5530,41542,884,83525,700,0001,066,0002,363,392
7May 3, 2026 19:5530,42145,896,98225,716,0001,055,0002,359,296
8May 3, 2026 19:5530,42340,331,15625,711,0001,062,0002,387,968
9May 3, 2026 19:5530,42545,467,63825,699,0001,075,0002,375,680