Run #ab373fe2

completed

Score

100% (4/4)

Runtime

10μs

vs Previous

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%Same as parent
72e0a3dd100%Same as parent
ef8ec475100%Same as parent
7774af03100%Same as parent
1906c4f0100%Same as parent
a881520b100%Same as parent
ff533f20100%Improved from parent
c07852e925%Regression from parent
6c4e319f100%Same as parent
0139cffd100%Same as parent
5fd7278e100%Same as parent
2fac06cd100%First in chain

Code

import array

def solve(input):
    if not input:
        return []
        
    output = array.array('i', [0] * len(input))
    output[0] = input[0]
    for i in range(1, len(input)):
        output[i] = input[i] - input[i - 1]
    
    return output.tolist()

Compare with Champion

Score Difference

Tied

Runtime Advantage

8μs slower

Code Size

12 vs 9 lines

#Your Solution#Champion
1import array1def solve(input):
22 if not input:
3def solve(input):3 return []
4 if not input:4 result = [input[0]]
5 return []5 previous = input[0]
6 6 for current in input[1:]:
7 output = array.array('i', [0] * len(input))7 result.append(current - previous)
8 output[0] = input[0]8 previous = current
9 for i in range(1, len(input)):9 return result
10 output[i] = input[i] - input[i - 1]10
11 11
12 return output.tolist()12
Your Solution
100% (4/4)10μs
1import array
2
3def solve(input):
4    if not input:
5        return []
6        
7    output = array.array('i', [0] * len(input))
8    output[0] = input[0]
9    for i in range(1, len(input)):
10        output[i] = input[i] - input[i - 1]
11    
12    return output.tolist()
Champion
100% (4/4)2μs
1def solve(input):
2    if not input:
3        return []
4    result = [input[0]]
5    previous = input[0]
6    for current in input[1:]:
7        result.append(current - previous)
8        previous = current
9    return result