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 19, 2026 14:18M-RochatM-RochatScore: 82,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:1981,991690,614,291618,105,00062,428,0002,138,112
2May 19, 2026 14:1982,041691,414,570617,640,00063,301,0002,138,112
3May 19, 2026 14:1982,047691,146,857618,125,00062,873,0002,138,112
4May 19, 2026 14:1982,054689,275,360617,729,00063,322,0002,138,112
5May 19, 2026 14:1982,166691,857,449618,144,00063,840,0002,138,112
6May 19, 2026 14:1982,272692,899,406618,129,00064,736,0002,138,112
7May 19, 2026 14:1982,600696,210,972619,252,00066,332,0002,138,112
8May 19, 2026 14:1982,606696,106,857619,077,00066,559,0002,138,112
9May 19, 2026 14:1983,326710,919,153621,382,00070,232,0002,138,112