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, 2021 05:59evgenikwtevgenikwtScore: 47,474Success
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, 2021 05:1747,391445,906,659393,343,75802,269,184
2May 24, 2021 05:5947,423445,182,773393,607,29102,265,088
3May 24, 2021 05:4947,428457,422,817393,654,65102,260,992
4May 24, 2021 05:1747,451451,780,039393,843,68902,277,376
5May 24, 2021 05:4947,474442,982,972394,036,43002,269,184
6May 24, 2021 05:5947,479452,642,937394,076,25502,273,280
7May 24, 2021 05:5947,482469,237,041394,102,91202,265,088
8May 24, 2021 05:1747,510455,680,474394,329,46502,256,896
9May 24, 2021 05:4947,529449,685,726394,491,75202,265,088