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 listMar 19, 2024 15:09Matt StuchlikMatt StuchlikScore: 30,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2024 15:0530,349319,087,206251,894,78602,273,280
2Mar 19, 2024 15:0530,349333,302,113251,895,38502,285,568
3Mar 19, 2024 15:0930,352312,865,951251,922,59602,285,568
4Mar 19, 2024 15:0930,355329,613,592251,950,37002,277,376
5Mar 19, 2024 15:0930,357329,501,225251,965,07202,289,664
6Mar 19, 2024 15:0530,358313,554,925251,972,54002,273,280
7Mar 19, 2024 15:0930,365317,761,182252,031,81002,273,280
8Mar 19, 2024 15:0930,367310,727,559252,044,27102,273,280
9Mar 19, 2024 15:0930,656330,720,866254,444,04602,293,760