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 listAug 24, 2026 17:47Victor MerckléVictor MerckléScore: 7,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:486,99467,970,43257,003,0001,048,0002,117,632stderr
2Aug 24, 2026 17:486,99567,889,46557,007,0001,054,0002,117,632stderr
3Aug 24, 2026 17:486,99767,888,09257,029,0001,050,0002,117,632stderr
4Aug 24, 2026 17:486,99767,909,93357,047,0001,033,0002,117,632stderr
5Aug 24, 2026 17:487,02568,081,55957,270,0001,045,0002,117,632stderr
6Aug 24, 2026 17:487,02668,186,24857,273,0001,049,0002,117,632stderr
7Aug 24, 2026 17:487,02768,215,72857,176,0001,153,0002,117,632stderr
8Aug 24, 2026 17:487,03768,266,22557,380,0001,035,0002,117,632stderr
9Aug 24, 2026 17:487,04668,310,29157,433,0001,049,0002,117,632stderr