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 22, 2021 17:56Yuriy LyfenkoYuriy LyfenkoScore: 17,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 17:5617,275167,140,059142,382,0001,002,0002,523,136
2May 22, 2021 17:5617,282164,721,722142,437,0001,003,0002,260,992
3May 22, 2021 17:5617,283165,699,866142,443,0001,003,0002,392,064
4May 22, 2021 17:5617,283164,375,692142,447,0001,003,0002,260,992
5May 22, 2021 17:5617,284164,750,021142,451,0001,003,0002,265,088
6May 22, 2021 17:5617,288171,745,840142,487,0001,003,0002,260,992
7May 22, 2021 17:5617,291174,851,233142,510,0001,003,0002,260,992
8May 22, 2021 17:5617,294174,252,375143,538,00002,260,992
9May 22, 2021 17:5617,323170,969,610141,788,0001,997,0002,265,088
10May 22, 2021 17:5617,789210,240,748147,644,57902,265,088
11May 22, 2021 17:5617,793204,261,373147,685,22102,269,184
12May 22, 2021 17:5617,814214,620,321147,855,28002,269,184