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 25, 2026 16:19Kenzie_RTKenzie_RTScore: 68,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:1967,425570,431,177558,562,0001,067,0002,113,536
2May 25, 2026 16:1968,530578,950,072567,660,0001,147,0002,113,536
3May 25, 2026 16:1968,537578,975,381567,796,0001,062,0002,113,536
4May 25, 2026 16:1968,571578,990,941568,040,0001,100,0002,113,536
5May 25, 2026 16:1968,576579,330,708568,119,0001,067,0002,113,536
6May 25, 2026 16:1968,583579,905,897568,084,0001,158,0002,113,536
7May 25, 2026 16:1968,656581,118,449568,715,0001,132,0002,113,536
8May 25, 2026 16:1968,666579,272,820568,868,0001,061,0002,113,536
9May 25, 2026 16:1968,676579,500,201568,953,0001,059,0002,113,536