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 listOct 29, 2021 20:46Ilya AniskovetsIlya AniskovetsScore: 40,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2021 20:4440,382412,352,576335,170,31602,269,184
2Oct 29, 2021 20:4640,413397,527,102335,425,03002,265,088
3Oct 29, 2021 20:4440,431396,759,032335,581,13502,260,992
4Sep 1, 2023 07:1340,447392,452,451335,706,81902,269,184
5Sep 1, 2023 07:1340,454391,345,517335,770,74802,265,088
6Sep 1, 2023 07:1340,480391,775,070335,984,60002,260,992
7Oct 29, 2021 20:4440,481393,313,044335,992,57102,269,184
8Oct 29, 2021 20:4640,491394,640,368336,072,90902,277,376
9Oct 29, 2021 20:4640,508401,124,838336,219,70602,265,088