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 29, 2022 22:35Alexander KimAlexander KimScore: 25,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2022 22:3525,511274,953,302211,741,66102,285,568
2Dec 29, 2022 22:3525,533293,262,156211,928,01702,285,568
3Dec 29, 2022 22:3525,550271,564,545212,065,63002,281,472
4Dec 29, 2022 22:3525,551236,539,751209,070,0003,001,0002,322,432
5Dec 29, 2022 22:3525,556236,386,756207,113,0005,002,0002,465,792
6Dec 29, 2022 22:3525,558236,944,797208,128,0004,002,0002,469,888
7Dec 29, 2022 22:3525,560236,025,676209,146,0003,002,0002,326,528
8Dec 29, 2022 22:3525,560235,239,736208,145,0004,002,0002,461,696
9Dec 29, 2022 22:3525,577238,111,707209,282,0003,004,0002,326,528
10Dec 29, 2022 22:3525,609238,941,734210,537,0002,014,0002,326,528
11Dec 29, 2022 22:3525,616238,247,387211,607,0001,002,0002,371,584
12Dec 29, 2022 22:3525,632236,631,194210,748,0001,997,0002,461,696