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 listMay 16, 2026 21:50M-RochatM-RochatScore: 27,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 21:5727,26533,094,32822,863,0001,131,0002,113,536
2May 16, 2026 21:5727,28632,660,53922,868,0001,144,0002,113,536
3May 16, 2026 21:5727,31034,761,87122,871,0001,162,0002,113,536
4May 16, 2026 21:5727,32633,504,98722,901,0001,146,0002,113,536
5May 16, 2026 21:5727,44333,064,67423,008,0001,142,0002,113,536
6May 16, 2026 21:5727,44635,756,45923,007,0001,146,0002,113,536
7May 16, 2026 21:5727,47033,682,43023,142,0001,032,0002,113,536
8May 16, 2026 21:5727,51134,826,46923,052,0001,158,0002,113,536
9May 16, 2026 21:5727,62533,503,04023,244,0001,066,0002,113,536