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 listDec 14, 2022 09:31Gubin DmitryGubin DmitryScore: 78,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 14, 2022 09:3178,615715,126,680652,503,84302,183,168
2Dec 14, 2022 09:3278,620713,418,835652,543,53202,195,456
3Dec 14, 2022 09:3278,621721,753,234652,557,40502,191,360
4Dec 14, 2022 09:3178,629722,856,116652,621,59702,187,264
5Dec 14, 2022 09:3178,633716,761,028652,651,01202,191,360
6Dec 14, 2022 09:3278,639714,805,313652,701,93402,183,168