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 19, 2022 15:35hiro116shiro116sScore: 60,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2022 15:3460,609581,957,003503,056,58302,174,976
2May 19, 2022 15:3460,630568,263,242503,230,99902,174,976
3May 19, 2022 15:3460,683566,132,744503,672,16002,301,952
4May 19, 2022 15:3660,831564,508,431504,897,96002,293,760
5May 19, 2022 15:3660,842571,594,450504,991,36402,285,568
6May 19, 2022 15:3660,868575,782,296505,201,52102,285,568
7May 19, 2022 15:3563,104588,689,814523,760,08102,203,648
8May 19, 2022 15:3563,148593,735,415524,129,49102,199,552
9May 19, 2022 15:3563,259581,948,554525,046,54902,207,744