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 listSep 1, 2021 19:24Ilya AniskovetsIlya AniskovetsScore: 66,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2021 19:2562,957600,093,064522,545,95502,269,184
2Sep 1, 2021 19:2563,006605,695,359522,945,79602,269,184
3Sep 1, 2021 19:2563,153589,901,759524,170,21802,265,088
4Sep 1, 2021 19:2466,566613,185,152552,497,58202,273,280
5Sep 1, 2021 19:2466,571604,794,641552,535,16102,277,376
6Sep 1, 2021 19:2466,588619,029,295552,684,12002,260,992