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 listFeb 7, 2026 00:45vahookvahookScore: 3,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 00:453,41715,869,1741,002,0002,005,0002,277,376
2Feb 7, 2026 00:453,41919,503,8851,003,0002,006,0002,502,656
3Feb 7, 2026 00:453,42418,901,6021,004,0002,009,0002,502,656
4Feb 7, 2026 00:453,43122,395,6061,006,0002,013,0002,498,560
5Feb 7, 2026 00:453,44319,757,1571,010,0002,020,0002,490,368
6Feb 7, 2026 00:453,44418,082,8671,010,0002,021,0002,490,368
7Feb 7, 2026 00:453,45821,229,5551,014,0002,029,0002,494,464
8Feb 7, 2026 00:453,46118,188,7971,015,0002,031,0002,502,656
9Feb 7, 2026 00:453,47822,395,0271,020,0002,041,0002,277,376
10Feb 7, 2026 00:453,49819,980,1821,026,0002,052,0002,498,560
11Feb 7, 2026 00:453,58116,845,2651,050,0002,101,0002,498,560
12Feb 7, 2026 00:453,65119,517,8191,071,0002,142,0002,498,560