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 listJun 22, 2026 11:58Josu San MartinJosu San MartinScore: 6,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 12:026,81413,828,4225,997,00002,113,536
2Jun 22, 2026 12:026,83913,588,6656,019,00002,113,536
3Jun 22, 2026 12:026,84013,488,1076,020,00002,113,536
4Jun 22, 2026 12:026,90613,597,6836,078,00002,113,536
5Jun 22, 2026 12:026,91313,588,7166,084,00002,113,536
6Jun 22, 2026 12:026,92313,871,5896,093,00002,113,536
7Jun 22, 2026 12:026,92913,982,4726,098,00002,113,536
8Jun 22, 2026 12:026,94513,671,8376,112,00002,113,536
9Jun 22, 2026 12:027,05713,733,0366,211,00002,113,536