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 5, 2026 00:05olliecrowolliecrowScore: 6,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 00:095,94356,608,80347,120,0002,207,0002,330,624
2May 5, 2026 00:095,95657,259,68847,269,0002,173,0002,359,296
3May 5, 2026 00:095,98157,715,99047,384,0002,260,0002,310,144
4May 5, 2026 00:096,00957,751,09547,788,0002,088,0002,351,104
5May 5, 2026 00:096,03157,492,12447,876,0002,187,0002,351,104
6May 5, 2026 00:096,07858,080,04748,179,0002,273,0002,555,904
7May 5, 2026 00:096,09159,337,08048,342,0002,216,0002,568,192
8May 5, 2026 00:096,09756,218,04748,410,0002,200,0002,355,200
9May 5, 2026 00:096,14759,611,49548,826,0002,197,0002,555,904