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:56Josu 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:57039,813,67531,117,0001,075,0002,113,536expected "53687838997510422 ", got "53687838741510422 "
2May 11, 2026 03:573,87540,049,94431,080,0001,084,0002,113,536
3May 11, 2026 03:573,89740,225,74931,280,0001,070,0002,113,536
4May 11, 2026 03:573,89942,319,83531,282,0001,080,0002,113,536
5May 11, 2026 03:573,90839,910,38631,381,0001,057,0002,113,536
6May 11, 2026 03:573,94742,839,69031,682,0001,084,0002,113,536
7May 11, 2026 03:573,95041,914,62931,714,0001,071,0002,113,536
8May 11, 2026 03:573,95342,286,98931,717,0001,095,0002,113,536
9May 11, 2026 03:573,96640,579,41131,851,0001,072,0002,113,536