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,184Success
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,171125,735,36299,021,0002,000,0002,523,136
2Mar 7, 2024 04:5312,174126,706,67399,046,0002,000,0002,277,376
3Mar 7, 2024 04:5312,175127,524,77399,053,0002,001,0002,285,568
4Mar 7, 2024 04:5312,176127,993,09599,056,0002,001,0002,285,568
5Mar 7, 2024 04:5312,178126,458,95799,080,0002,001,0002,523,136
6Mar 7, 2024 04:5312,181134,876,423100,099,0001,000,0002,260,992
7Mar 7, 2024 04:5312,184126,693,01199,124,0002,002,0002,265,088
8Mar 7, 2024 04:5312,190125,789,53299,177,0002,003,0002,285,568
9Mar 7, 2024 04:5312,194128,015,44799,207,0002,004,0002,269,184
10Mar 7, 2024 04:5312,333156,137,157102,360,83102,293,760
11Mar 7, 2024 04:5312,333158,870,683102,360,69502,297,856
12Mar 7, 2024 04:5312,367168,859,458102,648,24702,289,664