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 12, 2024 18:06Joad 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 12, 2024 18:0600000Error: expected "53683165177317239 ", got "53682987228611538 "stderr
2Oct 12, 2024 18:0600000Error: expected "53689604542611556 ", got "53689409833639824 "stderr
3Oct 12, 2024 18:0600000Error: expected "53682823327860047 ", got "53682633153925305 "stderr
4Oct 12, 2024 18:0600000Error: expected "53690560098778816 ", got "53690367914931689 "stderr
5Oct 12, 2024 18:0600000Error: expected "53691388079972555 ", got "53691194552872185 "stderr
6Oct 12, 2024 18:0700000Error: expected "53691613725640798 ", got "53691417371026558 "stderr
7Oct 12, 2024 18:4300000Error: expected "53691898376140696 ", got "53691713413108793 "stderr