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 24, 2024 14:11Matt 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 24, 2024 14:1100000Error: Exit with code 1: Segmentation fault at address: 0x58b0b0b120stderr
2May 24, 2024 14:1100000Error: Exit with code 1: Segmentation fault at address: 0xdc0b05c0stderr
3May 24, 2024 14:1200000Error: Exit with code 1: Segmentation fault at address: 0x6301605900stderr
4May 24, 2024 14:1200000Error: Exit with code 1: Segmentation fault at address: 0x6302c000stderr
5May 24, 2024 14:1200000Error: Exit with code 1: Segmentation fault at address: 0x6e0582c120stderr
6May 24, 2024 14:1300000Error: expected "53691773473429520 ", got "53691841462099589 "