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 listNov 23, 2025 07:56RacRacScore: 94,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2025 07:5693,889105,657,36382,622,00002,285,568
2Nov 23, 2025 07:5694,007113,322,67682,726,00002,277,376
3Nov 23, 2025 07:5694,170105,984,44280,874,0001,996,0002,281,472
4Nov 23, 2025 07:5694,265106,493,77380,955,0001,998,0002,269,184
5Nov 23, 2025 07:5694,331105,537,62782,011,0001,000,0002,285,568
6Nov 23, 2025 07:5694,358105,095,47382,035,0001,000,0002,285,568
7Nov 23, 2025 07:5694,427105,522,55781,094,0002,002,0002,285,568
8Nov 23, 2025 07:5694,669106,631,05481,302,0002,007,0002,285,568
9Nov 23, 2025 07:5694,675105,698,59382,311,0001,003,0002,269,184