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 10:29limanjun99limanjun99Score: 4,467Success
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 10:294,42056,301,44933,474,0003,219,0002,510,848
2May 4, 2026 10:294,45252,260,21533,708,0003,250,0002,498,560
3May 4, 2026 10:294,45856,644,25333,673,0003,333,0002,498,560
4May 4, 2026 10:294,46051,922,98333,425,0003,596,0002,494,464
5May 4, 2026 10:294,46755,078,24533,888,0003,194,0002,510,848
6May 4, 2026 10:294,47755,447,36533,899,0003,266,0002,490,368
7May 4, 2026 10:294,48555,530,48133,711,0003,518,0002,502,656
8May 4, 2026 10:294,50755,733,27333,978,0003,438,0002,498,560
9May 4, 2026 10:294,52055,452,84634,283,0003,236,0002,502,656