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 listJul 2, 2026 19:18Victor MerckléVictor MerckléScore: 4,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 19:214,54511,877,0454,000,00002,117,632stderr
2Jul 2, 2026 19:214,57311,815,8954,025,00002,117,632stderr
3Jul 2, 2026 19:214,59212,388,5854,041,00002,117,632stderr
4Jul 2, 2026 19:214,68911,837,1994,127,00002,117,632stderr
5Jul 2, 2026 19:214,71411,871,6474,149,00002,117,632stderr
6Jul 2, 2026 19:214,71511,793,1094,150,00002,117,632stderr
7Jul 2, 2026 19:214,73111,860,2194,164,00002,117,632stderr
8Jul 2, 2026 19:214,73412,141,4444,166,00002,117,632stderr
9Jul 2, 2026 19:214,74311,888,3654,174,00002,117,632stderr