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 listAug 29, 2026 13:57Victor MerckléVictor MerckléScore: 4,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 14:014,56512,201,4234,018,00002,117,632stderr
2Aug 29, 2026 14:014,57112,200,6284,023,00002,117,632stderr
3Aug 29, 2026 14:014,58712,229,6344,037,00002,117,632stderr
4Aug 29, 2026 14:014,59712,218,0814,046,00002,117,632stderr
5Aug 29, 2026 14:014,62312,289,6494,069,00002,117,632stderr
6Aug 29, 2026 14:014,66212,368,3874,103,00002,117,632stderr
7Aug 29, 2026 14:014,67112,769,9264,111,00002,117,632stderr
8Aug 29, 2026 14:014,67612,273,1654,115,00002,117,632stderr
9Aug 29, 2026 14:014,68812,268,3684,126,00002,117,632stderr