Fibonacci for 2016!

Here is a python solution I came up with:

fib = [1,1]

def update_fib(fib):
    return [fib[-1], fib[-1] + fib[-2]]

for i in range(3, 2017):
    fib = update_fib(fib)

print reduce(lambda x, y: int(x) + int(y), str(fib[-1])[-9:])

The idea behind it is that fib is always a list of two (since that's the only amount of space we need to compute the next value anyway), and it gets updated until the 2016th number is reached. The cheesy one liner at the bottom casts this huge number as a string, chops off all but the last nine digits, then performs a reduce by recasting each individual digit as an integer and summing. Full pass takes about 2ms on average.

I'd love to see what else you all come up with!

a=slice(0,9) print sum(list(map(int,(str(fib[2016])[::-1])[a])))