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 10, 2026 19:30Josu 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 10, 2026 19:31042,243,28930,912,0001,074,0002,113,536expected "53686539613182823 ", got "53686537915694862 "
2May 10, 2026 19:31040,428,24731,212,0001,084,0002,113,536expected "53686675295068424 ", got "53686675039068424 "
3May 10, 2026 19:313,85339,222,46330,923,0001,063,0002,113,536
4May 10, 2026 19:313,85940,611,72030,960,0001,071,0002,113,536
5May 10, 2026 19:313,86340,751,81330,963,0001,108,0002,113,536
6May 10, 2026 19:313,86939,668,41931,047,0001,073,0002,113,536
7May 10, 2026 19:313,89142,031,69331,233,0001,066,0002,113,536
8May 10, 2026 19:313,91140,788,73931,362,0001,101,0002,113,536
9May 10, 2026 19:313,95443,793,31331,740,0001,083,0002,113,536