# EulerProblem048

# Self powers (Euler Problem 48)¶

Back to overview.

https://projecteuler.net/problem=48

The series, $1^1 + 2^2 + 3^3 + ... + 10^{10} = 10405071317$.

Find the last ten digits of the series, $1^1 + 2^2 + 3^3 + ... + 1000^{1000}$.

Okay, this would be way harder in C/C++. In every language with long int support it is easy. See the number of people who have solved it.

In [7]:

    s = int(str(sum([i**i for i in range(1, 1001)]))[-10:])
    assert(s == 9110846700)
    print(s)

    9110846700

In [ ]: