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 1, 2026 05:14limanjun99limanjun99Score: 40,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 05:1540,509356,296,163335,230,0001,000,0002,519,040
2May 1, 2026 05:1540,522352,938,983334,338,0002,002,0002,514,944
3May 1, 2026 05:1540,526354,244,215334,366,0002,002,0002,514,944
4May 1, 2026 05:1540,547355,562,468333,546,0002,995,0002,514,944
5May 1, 2026 05:1540,758352,658,350336,296,0002,001,0002,510,848
6May 1, 2026 05:1540,793353,229,783335,587,0002,996,0002,506,752
7May 1, 2026 05:1540,812358,879,954335,744,0002,997,0002,498,560
8May 1, 2026 05:1540,856357,896,057337,107,0002,000,0002,510,848
9May 1, 2026 05:1540,860359,725,569336,148,0002,992,0002,502,656