Simple algorithm implementation (multiplication with sums), simple concept of optimization (with measurement of performance improvement), PyLint applied (10/10)

multiplication.py

#!/usr/bin/env python

''' Multiplication with sums. '''

def multiplication(first, second):
    ''' Multiply: first*second. '''

    accumulator = 0

    for _ in range(second):
        accumulator += first

    return accumulator

def multiplication_optimized(first, second):
    ''' Multiply: first*second. '''

    repetitions = min(first, second)
    added = max(first, second)

    accumulator = 0

    for _ in range(repetitions):
        accumulator += added

    return accumulator

def testing():
    ''' Tests unoptimized vs optimized versions. '''

    import timeit

    print multiplication(3, 4)

    print multiplication(100, 400)
    time_multiplication = timeit.timeit('multiplication(100, 400)',
                                        number=10000,
                                        setup="from __main__ import multiplication")

    print multiplication_optimized(100, 400)
    time_multiplication_opt = timeit.timeit('multiplication_optimized(100, 400)',
                                            number=10000,
                                            setup="from __main__ import multiplication_optimized")

    print time_multiplication, \
          time_multiplication_opt, \
          time_multiplication-time_multiplication_opt

if __name__ == '__main__':
    testing()