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 listAug 10, 2023 17:56temporary-enlightenmenttemporary-enlightenmentScore: 59,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2023 18:0159,913563,107,074497,278,85702,285,568
2Aug 10, 2023 18:0159,922560,451,530497,352,08002,297,856
3Aug 10, 2023 18:0159,950559,370,451497,581,53502,269,184
4Aug 10, 2023 17:5659,958554,523,877497,650,54402,285,568
5Aug 10, 2023 17:5659,960565,775,323497,667,35102,281,472
6Aug 10, 2023 17:5659,970554,985,844497,751,49502,285,568