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 6, 2026 07:23flavio87flavio87Score: 15,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 07:2315,676145,886,593128,098,0002,019,0002,445,312
2May 6, 2026 07:2315,679146,311,489128,019,0002,119,0002,428,928
3May 6, 2026 07:2315,683148,013,983128,036,0002,141,0002,420,736
4May 6, 2026 07:2315,689148,227,029128,143,0002,081,0002,416,640
5May 6, 2026 07:2315,709148,187,287128,337,0002,052,0002,404,352
6May 6, 2026 07:2315,724147,383,668128,429,0002,086,0002,424,832
7May 6, 2026 07:2315,765147,541,630128,797,0002,056,0002,433,024
8May 6, 2026 07:2315,774151,384,272128,856,0002,073,0002,424,832
9May 6, 2026 07:2315,889150,589,732129,777,0002,107,0002,396,160