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 listApr 27, 2026 10:51Pavel SkripkinPavel SkripkinScore: 39,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:5339,00350,695,26033,314,0001,009,0002,433,024
2Apr 27, 2026 10:5339,00749,327,16333,318,0001,009,0002,437,120
3Apr 27, 2026 10:5339,02648,460,94233,333,0001,010,0002,437,120
4Apr 27, 2026 10:5339,03444,930,60533,340,0001,010,0002,330,624
5Apr 27, 2026 10:5339,05453,657,00433,358,0001,010,0002,433,024
6Apr 27, 2026 10:5339,13850,758,90333,429,0001,013,0002,437,120
7Apr 27, 2026 10:5339,14053,097,95233,431,0001,013,0002,498,560
8Apr 27, 2026 10:5339,15046,484,26133,439,0001,013,0002,420,736
9Apr 27, 2026 10:5339,23551,014,87334,527,00002,424,832