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 08:06Matt 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 08:0600000Error: Exit with code 1: Segmentation fault at address: 167804992stderr
2May 28, 2024 08:0700000Error: Exit with code 1: Segmentation fault at address: 2416050304stderr
3May 28, 2024 08:0800000Error: Exit with code 1: Segmentation fault at address: 1208025120stderr
4May 28, 2024 08:0900000Error: Exit with code 1: Segmentation fault at address: 2621953stderr
5May 28, 2024 08:1000000Error: Exit with code 1: Segmentation fault at address: 75501570stderr
6May 28, 2024 08:1100000Error: expected "53687616402771382 ", got "53687627533152065 "
7May 28, 2024 08:1200000Error: Exit with code 1: Segmentation fault at address: 537460800stderr
8May 28, 2024 08:1300000Error: Exit with code 1: Segmentation fault at address: 604012560stderr