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 listDec 22, 2021 03:55Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2021 03:5500000Error: expected "53689288849758663 ", got "53689288849733063 "
2Dec 22, 2021 03:5800000Error: expected "53688117102246946 ", got "53688117101991046 "
3Dec 22, 2021 03:5831,891340,427,216264,696,59502,220,032
4Dec 22, 2021 03:5031,893323,658,330264,716,02502,228,224
5Dec 22, 2021 03:5831,904329,613,555264,804,50402,224,128
6Dec 22, 2021 03:5031,911329,494,686264,861,22602,215,936
7Dec 22, 2021 03:5531,918323,669,858264,916,64502,224,128
8Dec 22, 2021 03:5831,920328,187,086264,934,21702,220,032
9Dec 22, 2021 03:5531,926337,828,496264,984,68502,215,936
10Dec 22, 2021 03:5531,928327,481,306265,003,23902,215,936
11Dec 22, 2021 03:5031,935326,938,766265,058,07102,220,032