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 11, 2026 22:24Victor MerckléVictor MerckléScore: 4,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 22:254,01541,758,02932,281,0001,047,0002,117,632stderr
2Aug 11, 2026 22:254,02441,774,24732,358,0001,045,0002,117,632stderr
3Aug 11, 2026 22:254,02541,839,13032,370,0001,045,0002,117,632stderr
4Aug 11, 2026 22:254,02941,908,66132,403,0001,044,0002,117,632stderr
5Aug 11, 2026 22:254,04041,940,56832,447,0001,086,0002,117,632stderr
6Aug 11, 2026 22:254,04842,007,38132,553,0001,048,0002,117,632stderr
7Aug 11, 2026 22:254,05142,012,31532,522,0001,105,0002,117,632stderr
8Aug 11, 2026 22:254,06642,200,40032,693,0001,056,0002,117,632stderr
9Aug 11, 2026 22:254,06742,233,08232,710,0001,049,0002,117,632stderr