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 12, 2022 03:56Yuriy LyfenkoYuriy LyfenkoScore: 7,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2022 03:567,04580,665,37455,448,0003,024,0002,285,568
2Sep 12, 2022 03:567,08588,764,80954,819,0003,986,0002,265,088
3Sep 12, 2022 03:567,10788,016,45655,991,0002,999,0002,314,240
4Sep 12, 2022 03:567,11780,495,90552,059,0007,008,0002,498,560
5Sep 12, 2022 03:567,13182,586,04456,182,0003,009,0002,330,624
6Sep 12, 2022 03:567,13580,060,19256,208,0003,011,0002,453,504
7Sep 12, 2022 03:567,14385,717,25357,275,0002,009,0002,473,984
8Sep 12, 2022 03:567,16589,826,12755,440,0004,032,0002,510,848
9Sep 12, 2022 03:567,19886,207,20455,759,0003,982,0002,355,200
10Sep 12, 2022 03:567,251139,812,19860,181,45402,220,032
11Sep 12, 2022 03:567,280135,654,05160,422,40002,256,896
12Sep 12, 2022 03:567,341112,934,75960,926,31102,285,568