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:39Josu 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:40042,654,61131,966,0001,078,0002,113,536expected "53687706793369533 ", got "53687923787171314 "
2May 11, 2026 01:403,86140,306,67030,981,0001,073,0002,113,536
3May 11, 2026 01:403,86340,386,65930,978,0001,085,0002,113,536
4May 11, 2026 01:403,87139,835,38031,063,0001,072,0002,113,536
5May 11, 2026 01:403,88139,913,16631,154,0001,066,0002,113,536
6May 11, 2026 01:403,90141,270,85931,277,0001,109,0002,113,536
7May 11, 2026 01:403,90240,067,98531,295,0001,092,0002,113,536
8May 11, 2026 01:403,91642,034,57531,416,0001,091,0002,113,536
9May 11, 2026 01:404,02841,287,54332,374,0001,060,0002,113,536