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 21:53Yuriy LyfenkoYuriy LyfenkoScore: 19,461Success
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 21:5319,452186,745,713160,452,0001,002,0002,396,160
2May 5, 2021 21:5319,458190,670,023161,498,00002,506,752
3May 5, 2021 21:5319,459188,869,556161,509,00002,387,968
4May 5, 2021 21:5319,461188,152,247160,525,0001,003,0002,260,992
5May 5, 2021 21:5319,461189,235,688160,524,0001,003,0002,260,992
6May 5, 2021 21:5319,464192,444,757160,545,0001,003,0002,260,992
7May 5, 2021 21:5319,489189,374,899158,767,0002,995,0002,260,992
8May 5, 2021 21:5319,490187,532,799159,769,0001,997,0002,469,888
9May 5, 2021 21:5320,257195,231,322167,133,0001,000,0002,260,992