Run #72e0a3dd

completed

Score

100% (4/4)

Runtime

4μs

vs Previous

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%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

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

Compare with Champion

Score Difference

Tied

Runtime Advantage

2μs slower

Code Size

10 vs 9 lines

#Your Solution#Champion
1def solve(input):1def solve(input):
2 if not input:2 if not input:
3 return []3 return []
4 4 result = [input[0]]
5 output = [0] * len(input)5 previous = input[0]
6 output[0] = input[0]6 for current in input[1:]:
7 for i in range(1, len(input)):7 result.append(current - previous)
8 output[i] = input[i] - input[i - 1]8 previous = current
9 9 return result
10 return output10
Your Solution
100% (4/4)4μs
1def solve(input):
2    if not input:
3        return []
4    
5    output = [0] * len(input)
6    output[0] = input[0]
7    for i in range(1, len(input)):
8        output[i] = input[i] - input[i - 1]
9    
10    return output
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