Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 9, 2026 12:46Victor MerckléVictor MerckléScore: 70,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 12:4670,133589,932,594581,000,0001,108,0002,117,632stderr
2Jul 9, 2026 12:4670,256590,918,473582,021,0001,111,0002,117,632stderr
3Jul 9, 2026 12:4670,290591,527,670582,321,0001,093,0002,117,632stderr
4Jul 9, 2026 12:4670,330591,823,935582,630,0001,110,0002,117,632stderr
5Jul 9, 2026 12:4670,603594,092,462584,909,0001,100,0002,117,632stderr
6Jul 9, 2026 12:4670,668594,454,944585,434,0001,113,0002,117,632stderr
7Jul 9, 2026 12:4670,788595,433,504586,538,0001,010,0002,117,632stderr
8Jul 9, 2026 12:4671,539601,740,861592,750,0001,026,0002,117,632stderr
9Jul 9, 2026 12:4671,634602,589,039593,502,0001,062,0002,117,632stderr