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, 2026 10:58Innokentii MeleshchenkoInnokentii MeleshchenkoScore: 390,268Success
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, 2026 10:58388,8453,238,249,2973,164,167,00063,248,0002,117,632
2May 28, 2026 10:58389,0943,239,938,9393,166,408,00063,073,0002,117,632
3May 28, 2026 10:58389,1343,239,452,8493,166,588,00063,231,0002,117,632
4May 28, 2026 10:58389,7433,246,137,2203,170,803,00064,067,0002,117,632
5May 28, 2026 10:58390,2683,248,588,0483,174,976,00064,253,0002,117,632
6May 28, 2026 10:58390,8163,255,069,5403,180,727,00063,049,0002,117,632
7May 28, 2026 10:58393,0613,273,600,4963,199,360,00063,053,0002,117,632
8May 28, 2026 10:58396,9483,304,070,3823,231,626,00063,050,0002,117,632
9May 28, 2026 10:58399,0653,323,643,8273,247,001,00065,245,0002,117,632