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 listOct 9, 2023 10:37Vladimir TatVladimir TatScore: 192,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2023 10:41192,4501,675,890,8321,597,338,33102,248,704
2Oct 9, 2023 10:37192,4701,664,312,0001,597,502,69502,260,992
3Oct 9, 2023 10:41192,4771,656,748,3381,597,560,98002,256,896
4Oct 9, 2023 10:37192,4941,656,669,5171,597,698,50902,256,896
5Oct 9, 2023 10:41192,5231,656,148,4111,597,941,54002,256,896
6Oct 9, 2023 10:37192,5451,661,383,0181,598,125,68002,260,992