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 11, 2026 03:54Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 03:54041,940,95131,669,0001,094,0002,113,536expected "53679610825722189 ", got "53679610569722189 "
2May 11, 2026 03:54040,820,96731,416,0001,095,0002,113,536expected "53685398408101496 ", got "53685398152101496 "
3May 11, 2026 03:54041,359,63731,268,0001,078,0002,113,536expected "53689561129192052 ", got "53689560873192052 "
4May 11, 2026 03:543,85640,132,20630,935,0001,071,0002,113,536
5May 11, 2026 03:543,86739,674,31931,019,0001,084,0002,113,536
6May 11, 2026 03:543,86839,719,54531,035,0001,070,0002,113,536
7May 11, 2026 03:543,86941,701,48331,040,0001,080,0002,113,536
8May 11, 2026 03:543,90340,892,41831,324,0001,077,0002,113,536
9May 11, 2026 03:543,98842,762,76832,036,0001,072,0002,113,536