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 listFeb 28, 2026 09:30ManuManuScore: 369,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 09:30368,3553,085,717,0412,988,384,00068,962,0002,363,392
2Feb 28, 2026 09:30368,3703,081,595,7942,988,502,00068,965,0002,285,568
3Feb 28, 2026 09:30368,7633,083,496,5283,005,760,00054,977,0002,293,760
4Feb 28, 2026 09:30368,8843,091,038,4652,996,768,00064,973,0002,285,568
5Feb 28, 2026 09:30369,4483,091,861,8352,998,451,00067,964,0002,359,296
6Feb 28, 2026 09:30370,7593,102,250,2073,015,335,00061,965,0002,293,760
7Feb 28, 2026 09:30370,8233,107,971,7663,015,855,00061,976,0002,285,568
8Feb 28, 2026 09:30370,9013,101,332,8493,022,508,00055,972,0002,285,568
9Feb 28, 2026 09:30371,3143,111,715,9652,998,937,00082,970,0002,285,568