Run #a26ef9a4

completed

Score

100% (4/4)

Runtime

3μs

vs Previous

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%Same as parent
2402e846100%Same as parent
fd4d992d100%Improved from parent
43aa7f6425%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):
    return [input[i] - input[i-1] if i else input[i] for i in range(len(input))]

Compare with Champion

Score Difference

Tied

Runtime Advantage

1μs slower

Code Size

2 vs 9 lines

#Your Solution#Champion
1def solve(input):1def solve(input):
2 return [input[i] - input[i-1] if i else input[i] for i in range(len(input))]2 if not input:
33 return []
44 result = [input[0]]
55 previous = input[0]
66 for current in input[1:]:
77 result.append(current - previous)
88 previous = current
99 return result
Your Solution
100% (4/4)3μs
1def solve(input):
2    return [input[i] - input[i-1] if i else input[i] for i in range(len(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