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 listJan 29, 2025 17:09KeefeKeefeScore: 1,529,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 17:091,526,4361,371,900,0841,342,265,000999,0002,273,280
2Jan 29, 2025 17:091,527,3771,375,548,4021,342,094,0001,998,0002,281,472
3Jan 29, 2025 17:091,529,2131,370,116,5491,344,708,000999,0002,281,472
4Jan 29, 2025 17:091,529,2631,371,349,3911,344,752,000999,0002,273,280
5Jan 29, 2025 17:091,529,3821,374,254,9211,344,857,000999,0002,277,376
6Jan 29, 2025 17:091,529,9241,375,142,4301,344,334,0001,999,0002,281,472
7Jan 29, 2025 17:091,530,0511,367,541,8661,345,446,000999,0002,273,280
8Jan 29, 2025 17:091,530,0881,369,724,9721,345,478,000999,0002,277,376
9Jan 29, 2025 17:091,533,2071,374,589,7131,348,223,000999,0002,273,280