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 listAug 31, 2023 02:27matsuoka-601matsuoka-601Score: 7,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2023 02:277,863122,700,87865,259,55502,301,952
2Aug 31, 2023 02:277,87389,239,81264,340,0001,005,0002,408,448
3Aug 31, 2023 02:277,87989,146,97464,391,0001,006,0002,416,640
4Aug 31, 2023 02:277,88291,734,76564,416,0001,006,0002,514,944
5Aug 31, 2023 02:277,88388,285,67364,425,0001,006,0002,519,040
6Aug 31, 2023 02:277,89790,928,99564,538,0001,008,0002,514,944
7Aug 31, 2023 02:277,908126,968,79465,637,15702,297,856
8Aug 31, 2023 02:277,90892,758,40764,628,0001,009,0002,420,736
9Aug 31, 2023 02:277,92994,098,52764,814,000997,0002,514,944
10Aug 31, 2023 02:277,94087,442,08863,902,0001,996,0002,514,944
11Aug 31, 2023 02:278,014142,784,39266,520,25502,301,952
12Aug 31, 2023 02:278,09890,576,58865,206,0002,006,0002,420,736