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 13:07wnwnScore: 3,444Success
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 13:093,39537,499,26428,186,00002,113,536
2May 10, 2026 13:093,41738,181,57928,364,00002,113,536
3May 10, 2026 13:093,43338,555,46328,498,00002,113,536
4May 10, 2026 13:093,43836,732,17028,536,00002,113,536
5May 10, 2026 13:093,44438,225,84928,586,00002,113,536
6May 10, 2026 13:093,44539,928,87728,599,00002,113,536
7May 10, 2026 13:093,44637,957,01628,609,00002,113,536
8May 10, 2026 13:093,44836,300,30628,623,00002,113,536
9May 10, 2026 13:093,46037,986,48527,645,0001,079,0002,113,536