Run #43aa7f64

completed

Score

25% (1/4)

Runtime

4μs

vs Previous

-75.0% vs parent

-75.0% vs best

Regression from parent

Solution Lineage

Current25%Regression from parent
8526c232100%Same as parent
bbb94a82100%Same as parent
1aeefd0e100%Same as parent
7b1e508d100%Same as parent
3933d6fd100%Same as parent
ab373fe2100%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

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

Compare with Champion

Score Difference

-75.0%

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