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 listJan 23, 2025 07:298QTK8QTKScore: 3,410,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 07:293,399,3413,020,578,9482,987,421,0003,999,0002,523,136
2Jan 23, 2025 07:293,399,4343,023,152,2122,989,504,0001,998,0002,277,376
3Jan 23, 2025 07:293,403,4893,020,535,6012,994,071,000999,0002,289,664
4Jan 23, 2025 07:293,405,5223,024,134,3172,994,860,0001,999,0002,277,376
5Jan 23, 2025 07:293,410,1433,029,764,0772,998,927,0001,999,0002,289,664
6Jan 23, 2025 07:293,412,4133,032,133,5693,001,924,000999,0002,289,664
7Jan 23, 2025 07:293,412,6143,027,763,2283,002,101,000999,0002,277,376
8Jan 23, 2025 07:293,418,2063,037,307,7963,007,022,000999,0002,277,376
9Jan 23, 2025 07:293,420,8573,033,746,5933,008,355,0001,999,0002,277,376