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 25, 2021 18:52Yuriy LyfenkoYuriy LyfenkoScore: 17,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2021 18:5217,504166,956,158145,287,00002,387,968
2May 25, 2021 18:5217,508166,674,973144,316,0001,002,0002,523,136
3May 25, 2021 18:5217,508169,482,128145,317,00002,260,992
4May 25, 2021 18:5217,509167,828,831144,323,0001,002,0002,392,064
5May 25, 2021 18:5217,511174,088,409144,336,0001,002,0002,260,992
6May 25, 2021 18:5217,511175,593,198145,338,00002,260,992
7May 25, 2021 18:5217,511167,058,346145,342,00002,260,992
8May 25, 2021 18:5217,553187,742,909145,687,59402,265,088
9May 25, 2021 18:5217,960174,909,154147,069,0002,000,0002,510,848
10May 25, 2021 18:5217,971172,365,766148,161,0001,001,0002,392,064
11May 25, 2021 18:5218,322212,295,485152,069,12402,211,840
12May 25, 2021 18:5218,415211,015,795152,844,85402,265,088