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 listJun 28, 2025 00:36Abhijit RamanAbhijit RamanScore: 67,453Success
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, 2025 23:0167,424589,686,406555,625,0003,997,0002,519,040
2May 25, 2025 23:0167,432589,626,781557,690,0001,998,0002,514,944
3Jun 28, 2025 00:3667,432591,881,609557,685,0001,998,0002,383,872
4Jun 28, 2025 00:3667,453587,101,479557,863,0001,999,0002,510,848
5May 25, 2025 23:0167,464584,590,602558,953,000999,0002,510,848
6Jun 28, 2025 00:3667,471584,246,473558,006,0002,000,0002,519,040