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 listOct 10, 2024 20:41Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 20:4200000Error: expected "53692596077446560 ", got "53692600186496607"stderr
2Oct 10, 2024 20:418,46493,962,61768,248,0002,007,0002,334,720
3Oct 10, 2024 20:428,46992,835,46567,284,0003,012,0002,334,720
4Oct 10, 2024 20:428,47392,160,06767,314,0003,014,0002,514,944
5Oct 10, 2024 20:418,49695,963,02767,494,0003,022,0002,510,848
6Oct 10, 2024 20:428,50296,370,32567,540,0003,024,0002,334,720
7Oct 10, 2024 20:418,50396,564,63368,591,0001,988,0002,510,848
8Oct 10, 2024 20:428,67195,687,08870,973,000999,0002,506,752
9Oct 10, 2024 20:418,67295,113,43969,976,0001,999,0002,523,136
10Oct 10, 2024 20:428,67492,921,15469,995,0001,999,0002,510,848
11Oct 10, 2024 20:418,68895,451,23869,103,0003,004,0002,330,624
12Oct 10, 2024 20:428,71993,789,88471,366,0001,005,0002,330,624
13Oct 10, 2024 20:418,81795,198,87571,175,0002,004,0002,506,752