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 5, 2021 02:52Yuriy LyfenkoYuriy LyfenkoScore: 22,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 02:5222,511212,518,579185,843,000999,0002,400,256
2May 5, 2021 02:5222,524217,085,894184,954,0001,999,0002,260,992
3May 5, 2021 02:5222,546215,179,422184,129,0003,002,0002,400,256
4May 5, 2021 02:5222,550211,260,198184,162,0003,002,0002,256,896
5May 5, 2021 02:5222,553214,811,879186,187,0001,001,0002,510,848
6May 5, 2021 02:5222,569210,518,859185,316,0002,003,0002,506,752
7May 5, 2021 02:5222,571206,772,818187,340,00002,260,992
8May 5, 2021 02:5222,572207,915,347186,343,0001,001,0002,256,896
9May 5, 2021 02:5222,586219,640,159184,458,0003,007,0002,396,160