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 23, 2026 06:52Josu San MartinJosu San MartinScore: 5,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 06:565,09011,975,8864,480,00002,113,536
2Jun 23, 2026 06:565,13811,985,4094,522,00002,113,536
3Jun 23, 2026 06:565,13911,969,5144,523,00002,113,536
4Jun 23, 2026 06:565,15111,982,9904,533,00002,113,536
5Jun 23, 2026 06:565,15712,025,3454,539,00002,113,536
6Jun 23, 2026 06:565,16211,983,9544,543,00002,113,536
7Jun 23, 2026 06:565,16711,961,5594,547,00002,113,536
8Jun 23, 2026 06:565,17511,986,9134,554,00002,113,536
9Jun 23, 2026 06:565,21713,178,3014,591,00002,113,536