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 listMay 19, 2021 20:04Yuriy LyfenkoYuriy LyfenkoScore: 17,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 20:0417,5092,635,643,430144,327,000995,0002,523,136
2May 19, 2021 20:0417,516254,024,777144,388,000995,0002,260,992
3May 19, 2021 20:0417,5212,847,231,952143,435,0001,992,0002,527,232
4May 19, 2021 20:0417,526386,005,641143,471,0001,992,0002,260,992
5May 19, 2021 20:0417,5262,833,322,503144,460,0001,003,0002,519,040
6May 19, 2021 20:0417,535493,874,997143,549,0001,993,0002,519,040
7May 19, 2021 20:0417,536386,580,372144,552,000996,0002,260,992
8May 19, 2021 20:0417,5421,398,439,320143,604,0001,994,0002,519,040
9May 19, 2021 20:0417,5441,340,233,829143,618,0001,994,0002,260,992
10May 19, 2021 20:0418,122970,599,474150,415,02402,269,184
11May 19, 2021 20:0418,140969,367,243150,565,63302,269,184
12May 19, 2021 20:0418,1501,460,094,335150,644,57302,269,184