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 listSep 19, 2022 01:38Yuriy LyfenkoYuriy LyfenkoScore: 7,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2022 01:387,28988,627,68857,475,0003,025,0002,359,296
2Sep 19, 2022 01:387,33288,726,46156,864,0003,990,0002,351,104
3Sep 19, 2022 01:387,35490,515,87057,035,0004,002,0002,314,240
4Sep 19, 2022 01:387,35786,534,16058,057,0003,002,0002,420,736
5Sep 19, 2022 01:387,36985,262,02757,152,0004,010,0002,289,664
6Sep 19, 2022 01:387,37783,951,62758,219,0003,011,0002,342,912
7Sep 19, 2022 01:387,40389,774,18160,439,0001,007,0002,334,720
8Sep 19, 2022 01:387,40383,716,32156,409,0005,036,0002,494,464
9Sep 19, 2022 01:387,420128,288,67461,588,43502,269,184
10Sep 19, 2022 01:387,44889,343,76658,828,0002,991,0002,494,464
11Sep 19, 2022 01:387,466123,822,18561,965,27602,195,456
12Sep 19, 2022 01:387,470119,264,78761,998,70502,285,568