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 9, 2026 23:49Andrii StolitniiAndrii StolitniiScore: 87,695Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:4987,395741,524,260652,211,00073,169,0002,330,624
2May 9, 2026 23:4987,443741,281,243652,389,00073,393,0002,322,432
3May 9, 2026 23:4987,488743,640,853653,072,00073,083,0002,330,624
4May 9, 2026 23:4987,683742,580,135653,704,00074,065,0002,334,720
5May 9, 2026 23:4987,695745,660,236654,260,00073,609,0002,338,816
6May 9, 2026 23:4987,713745,332,748654,559,00073,464,0002,330,624
7May 9, 2026 23:4987,749742,966,830653,647,00074,673,0002,326,528
8May 9, 2026 23:4987,782745,471,156653,923,00074,673,0002,326,528
9May 9, 2026 23:4987,785747,889,103653,761,00074,862,0002,330,624