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 4, 2023 18:52Erdem KeskinErdem KeskinScore: 82,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2023 18:1882,576744,849,645685,379,45702,232,320
2Jul 4, 2023 18:2282,635754,524,763685,868,08902,215,936
3Jul 4, 2023 18:1882,636743,920,460685,882,33802,232,320
4Jul 4, 2023 18:2282,680757,822,681686,247,07402,236,416
5Jul 4, 2023 18:1882,691746,091,992686,336,70602,240,512
6Jul 4, 2023 18:5282,694751,628,195686,359,51802,232,320
7Jul 4, 2023 18:2282,701746,049,737686,418,24902,240,512
8Jul 4, 2023 18:5282,707743,677,245686,470,18902,240,512
9Jul 4, 2023 18:5282,777756,853,475687,047,58202,228,224