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 04:19vahookvahookScore: 3,410Success
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 04:193,35521,678,191984,0001,968,0002,277,376
2Feb 7, 2026 04:193,36618,788,471987,0001,975,0002,502,656
3Feb 7, 2026 04:193,38518,558,199993,0001,986,0002,494,464
4Feb 7, 2026 04:193,39923,015,579997,0001,994,0002,498,560
5Feb 7, 2026 04:193,40217,429,863998,0001,996,0002,490,368
6Feb 7, 2026 04:193,41022,252,6541,000,0002,001,0002,494,464
7Feb 7, 2026 04:193,41014,937,1411,000,0002,001,0002,273,280
8Feb 7, 2026 04:193,41320,471,6381,001,0002,002,0002,502,656
9Feb 7, 2026 04:193,41322,295,7841,001,0002,002,0002,494,464
10Feb 7, 2026 04:193,42620,391,6751,005,0002,010,0002,494,464
11Feb 7, 2026 04:193,47520,968,3641,019,0002,039,0002,498,560
12Feb 7, 2026 04:193,47820,834,5451,020,0002,041,0002,502,656