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:33limanjun99limanjun99Score: 5,863Success
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:335,79068,215,94345,817,0002,247,0002,502,656
2May 4, 2026 07:335,80965,522,07345,119,0003,098,0002,506,752
3May 4, 2026 07:335,81663,762,12445,021,0003,255,0002,498,560
4May 4, 2026 07:335,82567,060,62645,062,0003,288,0002,498,560
5May 4, 2026 07:335,86365,501,03245,102,0003,568,0002,498,560
6May 4, 2026 07:335,87070,021,88845,418,0003,309,0002,502,656
7May 4, 2026 07:335,91866,855,61646,859,0002,268,0002,502,656
8May 4, 2026 07:335,93466,232,48846,134,0003,125,0002,506,752
9May 4, 2026 07:335,96467,224,32246,284,0003,221,0002,490,368