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 7, 2024 04:53Huy Duc LeHuy Duc LeScore: 12,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 04:5312,168133,270,56798,992,0001,999,0002,273,280
2Mar 7, 2024 04:5312,171126,608,51199,016,0002,000,0002,269,184
3Mar 7, 2024 04:5312,172131,040,238100,031,0001,000,0002,265,088
4Mar 7, 2024 04:5312,174130,943,66399,046,0002,000,0002,265,088
5Mar 7, 2024 04:5312,176128,056,18699,060,0002,001,0002,285,568
6Mar 7, 2024 04:5312,181133,698,98099,102,0002,002,0002,285,568
7Mar 7, 2024 04:5312,183126,776,736100,121,0001,001,0002,285,568
8Mar 7, 2024 04:5312,207125,800,78798,307,0003,009,0002,265,088
9Mar 7, 2024 04:5312,330129,628,842101,336,0001,003,0002,285,568
10Mar 7, 2024 04:5312,334183,404,994102,376,33102,289,664
11Mar 7, 2024 04:5312,355170,691,690102,543,82802,301,952
12Mar 7, 2024 04:5312,368171,665,052102,656,44202,297,856