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 listSep 1, 2021 11:05Ilya AniskovetsIlya AniskovetsScore: 41,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2021 11:2341,235408,681,574342,250,05702,281,472
2Sep 1, 2021 11:0541,311408,119,398342,883,12802,285,568
3Sep 1, 2021 11:2341,323421,509,148342,984,69102,252,800
4Sep 1, 2021 11:0541,331418,540,749343,046,06502,289,664
5Sep 1, 2021 11:0541,406413,684,324343,668,07902,277,376
6Sep 1, 2021 11:2341,430419,960,868343,866,78602,281,472