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 listSep 6, 2026 12:10CheckHarryCheckHarryScore: 3,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 12:133,98044,165,32432,019,0001,018,0002,113,536
2Sep 6, 2026 12:133,98342,904,46432,052,0001,009,0002,113,536
3Sep 6, 2026 12:133,98543,027,95632,027,0001,052,0002,113,536
4Sep 6, 2026 12:133,98653,000,55732,036,0001,055,0002,113,536
5Sep 6, 2026 12:133,99944,293,56032,078,0001,115,0002,113,536
6Sep 6, 2026 12:134,17244,498,39633,620,0001,012,0002,113,536
7Sep 6, 2026 12:134,19845,434,24933,836,0001,009,0002,113,536
8Sep 6, 2026 12:134,20644,718,32733,901,0001,009,0002,113,536
9Sep 6, 2026 12:134,21944,880,67134,013,0001,009,0002,113,536