If I interpreted the question correctly, then you have a list of 100 n-dimensional vectors, and you need a list of their (Euclidean) norms.
I think using numpy is easier (and faster!) Here,
import numpy as np a = np.array(x) np.sqrt((a*a).sum(axis=1))
If the vectors do not have the same dimension or if you want to avoid numpy, then perhaps
[sum([i*i for i in vec])**0.5 for vec in x]
or,
import math [math.sqrt(sum([i*i for i in vec])) for vec in x]
Change Not quite sure what you requested. So, alternatively: it looks like you have a list, each element of which is an n-dimensional vector, and you want the Euclidean distance between each consecutive pair. With numpy (assuming n is fixed)
x = [ [1,2,3], [4,5,6], [8,9,10], [13,14,15] ]
where the last line is returned,
array([ 5.19615242, 6.92820323, 8.66025404])