Manhattan distance of rotation sequence I though this would be a good challenge : http://adventofcode.com/2016/day/1
Task description
Given a sequence of rotations and distances following the pattern (L|R)[1-9][0-9]*, give the manhattan distance between the start and the ending points, that is the minimal number of vertical and horizontal moves on a grid.
Examples
For example, if we assume you started facing North:
Following R2, L3 leaves you 2 blocks East and 3 blocks North, or 5 blocks away.
R2, R2, R2 leaves you 2 blocks due South of your starting position, which is 2 blocks away.
R5, L5, R5, R3 leaves you 12 blocks away.
Technical details
You can choose the separator between the moves (e.g. : &quot;\n&quot;, &quot;, &quot;, or &quot;,&quot;).
You must give the answer as an integer in base 10.
Not a duplicate!
It is not a duplicate for multiple reasons :

The moves are not the same. Here they are rotations, not directions.
I want the Manhattan distance, not the euclidian.
Python 3, 109 99 104 101 bytes



This is a simple answer that uses complex numbers, with input as a space-separated string or a newline-separated string. Golfing suggestions welcome!

Edit: -13 bytes thanks to Labo. +5 bytes for converting to an int.

d=p=0
for r in input().split():d+=1-2*(r&lt;'R');p+=1j**d*int(r[1:])
print(int(abs(p.real)+abs(p.imag)))


Ungolfing

def manhattan_rotation(seq, nsew=0, pos = 0):
    for rot in seq.split():
        # change direction
        if rot[0] == "L":
            nsew += -1 
        else:
            nsew += 1
        # move in that direction rot[1:] times
        pos += 1j ** nsew * int(rot[1:])
    return int(abs(pos.real)+abs(pos.imag))