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 17, 2021 20:14Yuriy LyfenkoYuriy LyfenkoScore: 17,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 20:1417,871671,844,750144,351,0003,982,0002,260,992
2May 17, 2021 20:1417,8773,175,544,748147,383,000995,0002,260,992
3May 17, 2021 20:1417,879363,366,614147,401,000995,0002,527,232
4May 17, 2021 20:1417,8802,639,694,194146,412,0001,992,0002,514,944
5May 17, 2021 20:1417,8881,405,037,393146,482,0001,992,0002,265,088
6May 17, 2021 20:1418,0262,367,925,566148,616,000997,0002,519,040
7May 17, 2021 20:1418,0332,138,018,120147,681,0001,995,0002,260,992
8May 17, 2021 20:1418,0332,107,116,642148,673,000997,0002,519,040
9May 17, 2021 20:1418,035548,155,171149,691,00002,396,160