Why the built-in functions of sum() and min() are much better than the simple implementation (comment out in the following) ? How do they improve the performance?

```
class Solution(object):
def minMoves(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
'''
m = sys.maxint
s = 0
for i in nums:
s += i
if i < m:
m = i
'''
m = min(nums)
s = sum(nums)
return s - m * len(nums)
```