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 4, 2026 07:39limanjun99limanjun99Score: 5,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 07:395,14358,358,87940,338,0002,353,0002,502,656
2May 4, 2026 07:395,15160,818,79040,418,0002,336,0002,502,656
3May 4, 2026 07:395,16460,813,02340,614,0002,250,0002,506,752
4May 4, 2026 07:395,16758,995,74339,666,0003,228,0002,502,656
5May 4, 2026 07:395,19262,952,43139,900,0003,199,0002,502,656
6May 4, 2026 07:395,20261,178,07939,651,0003,531,0002,502,656
7May 4, 2026 07:395,20861,530,29940,900,0002,330,0002,506,752
8May 4, 2026 07:395,22258,708,90641,066,0002,281,0002,506,752
9May 4, 2026 07:395,29560,684,33440,713,0003,240,0002,502,656