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 6, 2023 03:03Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2023 03:0300000Error: expected "53682159588328120 ", got "53682133988328120 "stderr
2Dec 6, 2023 03:0300000Error: expected "53692749340069078 ", got "53692723740069078 "stderr
3Dec 6, 2023 03:0400000Error: expected "53691701793009608 ", got "53691676193009608 "stderr
4Dec 6, 2023 03:0400000Error: expected "53689974176859487 ", got "53689948576856927 "stderr
5Dec 6, 2023 03:0400000Error: expected "53681040793570238 ", got "53681015193570238 "stderr
6Dec 6, 2023 03:0400000Error: expected "53685108501070223 ", got "53685082901070223 "stderr
7Dec 6, 2023 03:0500000Error: expected "53691396728059317 ", got "53691371128059317 "stderr
8Dec 6, 2023 03:057,216131,799,17559,893,51602,301,952
9Dec 6, 2023 03:057,256128,220,88760,225,47202,252,800
10Dec 6, 2023 03:057,276127,216,92760,393,95702,220,032