In the following 6 digit number:
```
283910
```
`91` is the greatest sequence of 2 consecutive digits.
In the following 10 digit number:
```
1234567890
```
`67890` is the greatest sequence of 5 consecutive digits.
Complete the solution so that it returns the greatest sequence of five consecutive digits found within the number given. The number will be passed in as a string of only digits. It should return a five digit integer. The number passed may be as large as 1000 digits. 
*Adapted from ProjectEuler.net*
def solution(digits):
    def helper_func(item):
        temp = ''
        for i in item:
            temp = temp + str(i)
        return temp
    number_arr = [i for i in digits]
    result = [number_arr[i:i+5] for i in range(0, len(number_arr) - 4)]
    string_res = [helper_func(i) for i in result]
    return max([int(i) for i in string_res])


def solution(digits):
    def helper_func(item):
        temp = ''
        for i in item:
            temp = temp + str(i)
        return temp
    number_arr = [i for i in digits]
    result = [number_arr[i:i+5] for i in range(0, len(number_arr) - 4)]
    string_res = [helper_func(i) for i in result]
    return max([int(i) for i in string_res])

