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 listJun 7, 2024 11:26GraceGraceScore: 85,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 11:2685,338773,518,740708,306,92402,240,512
2Jun 7, 2024 11:2685,354767,713,136708,440,55202,240,512
3Jun 7, 2024 11:2685,374783,022,067708,604,70202,240,512
4Jun 7, 2024 11:2685,381772,453,601708,662,21102,240,512
5Jun 7, 2024 11:2685,718780,885,986711,456,79302,240,512
6Jun 7, 2024 11:2685,721779,258,452711,487,53502,236,416
7Jun 7, 2024 11:2685,782774,576,624711,991,97502,236,416
8Jun 7, 2024 11:2685,829774,030,561712,379,80902,236,416
9Jun 7, 2024 11:2686,088770,042,831714,530,86402,236,416
10Jun 7, 2024 11:2686,109776,892,960714,708,37902,244,608
11Jun 7, 2024 11:2686,151782,757,223715,050,06002,252,800
12Jun 7, 2024 11:2686,211780,947,336715,551,28402,236,416