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 15, 2026 12:13wnwnScore: 3,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 12:133,29937,741,35227,382,00002,113,536
2May 15, 2026 12:133,30335,955,76827,419,00002,113,536
3May 15, 2026 12:133,31234,981,76127,494,00002,113,536
4May 15, 2026 12:133,31937,842,38227,555,00002,113,536
5May 15, 2026 12:133,32336,743,47727,584,00002,113,536
6May 15, 2026 12:133,34136,996,11727,738,00002,113,536
7May 15, 2026 12:133,39336,570,54928,165,00002,113,536
8May 15, 2026 12:133,47336,097,49928,826,00002,113,536
9May 15, 2026 12:133,48936,402,36928,961,00002,113,536