Run #1aeefd0e

completed

Score

100% (4/4)

Runtime

9μs

vs Previous

No change vs parent

Tied for best

Same as parent

Solution Lineage

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

from array import array

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

Compare with Champion

Score Difference

Tied

Runtime Advantage

7μs slower

Code Size

15 vs 9 lines

#Your Solution#Champion
1from array import 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 n = len(input)7 result.append(current - previous)
8 result = array('i', [0] * n)8 previous = current
9 result[0] = input[0]9 return result
10 prev = input[0]10
11 for i in range(1, n):11
12 current = input[i]12
13 result[i] = current - prev13
14 prev = current14
15 return result.tolist()15
Your Solution
100% (4/4)9μs
1from array import array
2
3def solve(input):
4 if not input:
5 return []
6
7 n = len(input)
8 result = array('i', [0] * n)
9 result[0] = input[0]
10 prev = input[0]
11 for i in range(1, n):
12 current = input[i]
13 result[i] = current - prev
14 prev = current
15 return result.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