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:49Josu 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:50040,806,97531,025,0001,086,0002,113,536expected "53694746595651324 ", got "53694746605064296 "
2May 11, 2026 01:50039,975,08031,177,0001,108,0002,113,536expected "53688066683260362 ", got "53688064917839912 "
3May 11, 2026 01:503,86939,917,11131,031,0001,084,0002,113,536
4May 11, 2026 01:503,87741,977,32531,083,0001,098,0002,113,536
5May 11, 2026 01:503,87841,666,73631,097,0001,091,0002,113,536
6May 11, 2026 01:503,88039,902,98631,121,0001,083,0002,113,536
7May 11, 2026 01:503,88139,884,81931,143,0001,072,0002,113,536
8May 11, 2026 01:503,88642,398,94531,121,0001,141,0002,113,536
9May 11, 2026 01:503,99043,822,73732,050,0001,071,0002,113,536