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 28, 2021 21:40Yuriy LyfenkoYuriy LyfenkoScore: 17,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2021 21:4017,133164,301,295141,201,0001,001,0002,396,160
2May 28, 2021 21:4017,200169,765,261141,758,0001,005,0002,260,992
3May 28, 2021 21:4017,201168,746,317142,767,00002,396,160
4May 28, 2021 21:4017,206174,901,536140,812,0001,997,0002,260,992
5May 28, 2021 21:4017,302168,133,307142,606,0001,004,0002,387,968
6May 28, 2021 21:4017,474170,914,369145,033,00002,392,064
7May 28, 2021 21:4017,540174,140,733145,586,00002,392,064
8May 28, 2021 21:4017,560178,721,820144,753,000998,0002,383,872
9May 28, 2021 21:4017,562196,001,902145,765,12902,265,088
10May 28, 2021 21:4017,572211,610,451145,847,33002,269,184
11May 28, 2021 21:4017,717174,067,761145,049,0002,000,0002,387,968
12May 28, 2021 21:4018,315195,925,396152,013,98002,265,088