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 listFeb 5, 2022 17:10RomanChuykoRomanChuykoScore: 141,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2022 17:11141,8531,255,497,6921,177,378,81902,260,992
2Feb 5, 2022 17:09141,9091,244,324,1141,177,846,45302,248,704
3Feb 5, 2022 17:09141,9441,235,190,5331,178,132,91302,256,896
4Feb 5, 2022 17:10141,9681,238,502,5181,178,337,55802,252,800
5Feb 5, 2022 17:11141,9771,247,600,3241,178,410,33802,256,896
6Feb 5, 2022 17:09141,9841,241,357,3161,178,470,07902,260,992
7Feb 5, 2022 17:11141,9991,254,962,5201,178,594,41702,256,896
8Feb 5, 2022 17:10142,0051,255,075,6261,178,639,47102,260,992
9Feb 5, 2022 17:10142,0501,249,339,4711,179,013,85002,256,896