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 10, 2026 10:31Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:32053,524,77033,029,0001,157,0002,494,464expected "53685852869719937 ", got "53686070161985935 "
2May 10, 2026 10:324,09451,979,32132,957,0001,026,0002,486,272
3May 10, 2026 10:324,09651,563,83932,854,0001,148,0002,478,080
4May 10, 2026 10:324,10450,728,29132,936,0001,129,0002,490,368
5May 10, 2026 10:324,10949,789,84633,056,0001,051,0002,478,080
6May 10, 2026 10:324,11650,571,01033,112,0001,054,0002,490,368
7May 10, 2026 10:324,12249,301,72233,162,0001,053,0002,469,888
8May 10, 2026 10:324,22450,045,66233,882,0001,179,0002,473,984
9May 10, 2026 10:324,42850,775,06935,668,0001,086,0002,490,368