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 listApr 29, 2026 13:32TudyMTudyMScore: 34,585Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:3434,41049,038,69828,263,0002,018,0002,379,776
2Apr 29, 2026 13:3434,51048,188,83429,357,0001,012,0002,383,872
3Apr 29, 2026 13:3434,54848,946,13429,390,0001,013,0002,375,680
4Apr 29, 2026 13:3434,58547,566,33627,392,0003,043,0002,297,856
5Apr 29, 2026 13:3434,58546,869,07328,406,0002,029,0002,371,584
6Apr 29, 2026 13:3434,59353,506,78328,413,0002,029,0002,371,584
7Apr 29, 2026 13:3434,59550,813,17728,415,0002,029,0002,375,680
8Apr 29, 2026 13:3434,66749,904,10229,491,0001,016,0002,379,776
9Apr 29, 2026 13:3434,76047,486,23728,550,0002,039,0002,363,392