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 listJan 17, 2022 10:06Andrey TsvetkovAndrey TsvetkovScore: 55,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 10:0555,781540,037,564462,981,24002,248,704
2Jan 17, 2022 10:0955,782524,095,979462,988,33002,252,800
3Jan 17, 2022 10:0955,785540,007,875463,019,20702,240,512
4Jan 17, 2022 10:0555,789538,239,600463,051,31502,244,608
5Jan 17, 2022 10:0555,800549,004,532463,140,59502,248,704
6Jan 17, 2022 10:0955,802530,792,984463,158,22302,252,800
7Jan 17, 2022 10:0655,809525,610,647463,211,70102,248,704
8Jan 17, 2022 10:0655,812526,701,144463,237,69802,252,800
9Jan 17, 2022 10:0655,818538,346,035463,286,63602,252,800