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 18:06Josu 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 18:06039,532,99031,117,0001,083,0002,113,536expected "53684001626088992 ", got "53684008549846051 "
2May 11, 2026 18:06067,557,64859,196,0001,009,0002,113,536expected "53688419132276856 ", got "53688636255306480 "
3May 11, 2026 18:06039,403,58431,094,0001,034,0002,113,536expected "53684375207760835 ", got "53684374951760835 "
4May 11, 2026 18:063,87540,450,68531,066,0001,097,0002,113,536
5May 11, 2026 18:063,89540,048,79831,230,0001,103,0002,113,536
6May 11, 2026 18:063,92040,367,38231,450,0001,094,0002,113,536
7May 11, 2026 18:063,93140,058,31331,528,0001,100,0002,113,536
8May 11, 2026 18:063,96840,951,67931,838,0001,097,0002,113,536
9May 11, 2026 18:063,97040,420,23031,935,0001,020,0002,113,536