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 listJun 12, 2021 01:31evgenikwtevgenikwtScore: 28,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 01:3128,718297,599,351238,357,06902,256,896
2Jun 12, 2021 01:3128,747294,819,635238,600,57102,252,800
3Jun 12, 2021 01:3128,767312,133,962238,768,69202,256,896
4Jun 12, 2021 01:3828,767313,021,765238,769,67702,252,800
5Jun 12, 2021 01:3828,819297,504,039239,197,94402,260,992
6Jun 12, 2021 01:3829,281311,521,572243,032,98002,252,800