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 20, 2026 00:30Josu San MartinJosu San MartinScore: 11,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 00:3211,05618,954,9738,718,0001,012,0002,117,632
2May 20, 2026 00:3211,08119,614,9268,701,0001,051,0002,117,632
3May 20, 2026 00:3211,10921,816,4558,717,0001,059,0002,117,632
4May 20, 2026 00:3211,19519,395,4918,801,0001,051,0002,117,632
5May 20, 2026 00:3211,23919,835,4718,832,0001,059,0002,113,536
6May 20, 2026 00:3211,95421,602,02010,520,00002,117,632
7May 20, 2026 00:3212,15520,751,9149,631,0001,066,0002,113,536
8May 20, 2026 00:3212,34822,952,4189,797,0001,070,0002,117,632
9May 20, 2026 00:3213,10022,200,00210,518,0001,010,0002,113,536