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 listMay 21, 2021 09:49Andrei GrazhdankovAndrei GrazhdankovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2021 09:2700000no run stats recorded
2May 21, 2021 09:4984,855776,985,413704,296,91202,293,760
3May 21, 2021 09:4984,927767,807,848704,895,26002,281,472
4May 21, 2021 09:4884,928765,330,174704,898,56602,281,472
5May 21, 2021 09:4984,947756,045,177705,061,66602,281,472
6May 21, 2021 09:4984,950762,213,749705,084,65602,281,472
7May 21, 2021 09:4884,960765,587,506705,169,51302,285,568
8May 21, 2021 09:4984,998768,257,637705,486,31002,273,280
9May 21, 2021 09:4985,018771,117,855705,651,68602,293,760
10May 21, 2021 09:4885,064759,123,136706,031,50902,285,568