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 24, 2021 06:12Andrei GrazhdankovAndrei GrazhdankovScore: 84,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2021 06:2584,659767,986,673702,666,45602,215,936
2May 24, 2021 06:1184,661769,354,129702,686,29902,224,128
3May 24, 2021 06:1284,661778,287,902702,688,18402,215,936
4May 24, 2021 06:2584,673776,031,198702,787,52402,220,032
5May 24, 2021 06:1184,679767,819,053702,833,75502,220,032
6May 24, 2021 06:1284,686771,209,618702,891,36702,228,224
7May 24, 2021 06:2584,693761,283,371702,948,63902,220,032
8May 24, 2021 06:1284,694776,309,714702,963,82302,224,128
9May 24, 2021 06:1184,697771,873,969702,985,83502,215,936