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 listAug 10, 2023 15:36igorfardocigorfardocScore: 37,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2023 15:3634,163343,543,686283,550,77202,289,664
2Aug 10, 2023 15:3737,008378,919,494307,170,23602,289,664
3Aug 10, 2023 15:3637,010378,981,768307,182,42302,297,856
4Aug 10, 2023 15:3637,020370,051,499307,265,40502,293,760
5Aug 10, 2023 15:3737,026365,830,011307,312,87702,183,168
6Aug 10, 2023 15:3737,044367,526,387307,464,08502,281,472
7Aug 10, 2023 15:3637,049365,077,609307,507,21502,293,760
8Aug 10, 2023 15:3637,054377,146,046307,550,85702,285,568
9Aug 10, 2023 15:3637,064368,769,053307,630,75302,297,856