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 27, 2026 02:48Victor MerckléVictor MerckléScore: 4,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:494,08842,330,96132,857,0001,078,0002,117,632stderr
2Aug 27, 2026 02:494,10342,455,29832,912,0001,143,0002,117,632stderr
3Aug 27, 2026 02:494,12042,612,08333,045,0001,155,0002,117,632stderr
4Aug 27, 2026 02:494,12342,682,93633,125,0001,102,0002,117,632stderr
5Aug 27, 2026 02:494,13742,729,16933,251,0001,088,0002,117,632stderr
6Aug 27, 2026 02:494,13942,802,19933,341,0001,014,0002,117,632stderr
7Aug 27, 2026 02:494,14242,785,13433,284,0001,095,0002,117,632stderr
8Aug 27, 2026 02:494,18743,130,82633,655,0001,102,0002,117,632stderr
9Aug 27, 2026 02:494,47646,185,23336,075,0001,080,0002,117,632stderr