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 listJul 31, 2022 15:50Yuriy LyfenkoYuriy LyfenkoScore: 10,693Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2022 15:5010,401148,229,60886,325,32902,236,416
2Jul 31, 2022 15:5010,471170,340,53486,905,62702,260,992
3Jul 31, 2022 15:5010,569116,162,25384,734,0002,990,0002,449,408
4Jul 31, 2022 15:5010,600112,291,45884,980,0002,999,0002,273,280
5Jul 31, 2022 15:5010,622182,703,24588,165,29302,252,800
6Jul 31, 2022 15:5010,649111,749,26584,372,0004,017,0002,363,392
7Jul 31, 2022 15:5010,693116,444,18884,760,0003,988,0002,478,080
8Jul 31, 2022 15:5010,695115,671,43483,781,0004,986,0002,449,408
9Jul 31, 2022 15:5010,868117,630,34185,192,0005,011,0002,383,872
10Jul 31, 2022 15:5010,903114,376,13385,465,0005,027,0002,379,776
11Jul 31, 2022 15:5010,941113,741,31685,818,0004,989,0002,351,104
12Jul 31, 2022 15:5011,060117,785,98586,806,0004,988,0002,301,952