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:45TudyMTudyMScore: 33,004Success
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:5132,84747,444,88425,916,0002,990,0002,375,680
2Apr 29, 2026 13:5132,89251,656,31625,951,0002,994,0002,379,776
3Apr 29, 2026 13:5132,95744,781,65827,003,0002,000,0002,306,048
4Apr 29, 2026 13:5132,97348,261,47724,014,0005,003,0002,387,968
5Apr 29, 2026 13:5133,00450,902,35727,041,0002,003,0002,367,488
6Apr 29, 2026 13:5133,03751,196,26226,066,0003,007,0002,375,680
7Apr 29, 2026 13:5133,04545,240,47227,075,0002,005,0002,371,584
8Apr 29, 2026 13:5133,05145,340,70624,071,0005,014,0002,367,488
9Apr 29, 2026 13:5133,15547,618,53527,165,0002,012,0002,379,776