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 01:13Josu 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 01:13039,826,70531,075,0001,084,0002,113,536expected "53694547078975709 ", got "53694547069226712 "
2May 11, 2026 01:133,86039,700,35630,971,0001,072,0002,113,536
3May 11, 2026 01:133,86040,022,46030,962,0001,081,0002,113,536
4May 11, 2026 01:133,86439,961,28530,993,0001,084,0002,113,536
5May 11, 2026 01:133,87441,652,53431,071,0001,085,0002,113,536
6May 11, 2026 01:133,88342,017,66731,145,0001,084,0002,113,536
7May 11, 2026 01:133,88541,951,05231,156,0001,092,0002,113,536
8May 11, 2026 01:133,90141,608,04131,315,0001,069,0002,113,536
9May 11, 2026 01:133,96442,554,23931,815,0001,091,0002,113,536