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 listDec 28, 2022 21:21Alexander KimAlexander KimScore: 28,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2022 21:2128,164260,560,592233,758,00002,326,528
2Dec 28, 2022 21:2128,166263,679,381230,780,0002,997,0002,457,600
3Dec 28, 2022 21:2128,176260,735,854231,859,0001,998,0002,519,040
4Dec 28, 2022 21:2128,176262,514,620230,865,0002,998,0002,469,888
5Dec 28, 2022 21:2128,177260,304,278230,875,0002,998,0002,326,528
6Dec 28, 2022 21:2128,204259,547,392230,093,0004,001,0002,539,520
7Dec 28, 2022 21:2128,209255,986,257231,133,0003,001,0002,326,528
8Dec 28, 2022 21:2128,213264,687,679232,170,0002,001,0002,326,528
9Dec 28, 2022 21:2128,216259,682,078230,192,0004,003,0002,473,984
10Dec 28, 2022 21:2128,218294,192,875234,213,29802,285,568
11Dec 28, 2022 21:2128,239291,675,652234,381,36402,285,568
12Dec 28, 2022 21:2128,243292,866,950234,414,40102,285,568