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 listMar 17, 2026 09:46limanjun99limanjun99Score: 6,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 09:466,53180,132,94552,200,0002,007,0002,289,664
2Mar 17, 2026 09:466,54175,770,14751,278,0003,016,0002,490,368
3Mar 17, 2026 09:466,54482,291,51652,302,0002,011,0002,490,368
4Mar 17, 2026 09:466,54976,992,65152,342,0002,013,0002,289,664
5Mar 17, 2026 09:466,55780,947,07853,417,0001,007,0002,289,664
6Mar 17, 2026 09:466,56276,614,00053,456,0001,008,0002,289,664
7Mar 17, 2026 09:466,57277,084,51553,534,0001,010,0002,502,656
8Mar 17, 2026 09:466,67582,198,49754,398,0001,007,0002,289,664
9Mar 17, 2026 09:466,69984,275,72452,568,0003,032,0002,494,464