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 28, 2024 07:56Matt StuchlikMatt StuchlikError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2024 07:5600000Error: Exit with code 1: Segmentation fault at address: 2281767040stderr
2May 28, 2024 07:5700000Error: Exit with code 1: Segmentation fault at address: 2151940224stderr
3May 28, 2024 07:5800000Error: Exit with code 1: Segmentation fault at address: 41951248stderr
4May 28, 2024 07:5900000Error: Exit with code 1: Segmentation fault at address: 570458144stderr
5May 28, 2024 08:0000000Error: Exit with code 1: Segmentation fault at address: 18875392stderr
6May 28, 2024 08:0100000Error: Exit with code 1: Segmentation fault at address: 4456704stderr
7May 28, 2024 08:0200000Error: Exit with code 1: Segmentation fault at address: 4719104stderr
8May 28, 2024 08:0300000Error: Exit with code 1: Segmentation fault at address: 570441736stderr
9May 28, 2024 08:0400000Error: Exit with code 1: Segmentation fault at address: 4719104stderr