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 listJul 30, 2022 15:46Yuriy LyfenkoYuriy LyfenkoScore: 8,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2022 15:467,863126,991,40265,266,17802,297,856
2Jul 30, 2022 15:467,879123,602,51065,399,13502,248,704
3Jul 30, 2022 15:467,917131,503,73265,712,68702,195,456
4Jul 30, 2022 15:468,00689,476,21964,433,0002,013,0002,420,736
5Jul 30, 2022 15:468,02292,046,32063,556,0003,026,0002,420,736
6Jul 30, 2022 15:468,02895,119,82163,605,0003,028,0002,469,888
7Jul 30, 2022 15:468,04692,416,29962,794,0003,986,0002,478,080
8Jul 30, 2022 15:468,05692,403,84562,876,0003,992,0002,437,120
9Jul 30, 2022 15:468,06993,101,01663,972,0002,998,0002,482,176
10Jul 30, 2022 15:468,07095,169,23159,984,0006,998,0002,265,088
11Jul 30, 2022 15:468,07891,767,36763,042,0004,002,0002,445,312
12Jul 30, 2022 15:468,14794,642,10564,589,0003,027,0002,371,584