list
is very cleverly implemented to allocate a small bit of over-allocation. So,
>>> l = []
>>> sys.getsizeof(l)
# i have a 64-bit system. This value would have been different in a 32-bit,
# and this is basic memory required by the data structure itself. Over time the append happens,
# the memory will be increased on a bit more than required.
# The growth pattern is: 0, 4, 8, 16, 25, 35, 46, 58, 72, 88, ...
72
>>> l.append(1)
>>> sys.getsizeof(l)
104
>>> l.append(2)
>>> sys.getsizeof(l)
104
>>> l
[1, 2]
>>> for i in range(100):l.append(i)
...
>>> l
[1, 2, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99]
>>> sys.getsizeof(l)
920
So if you were to empty the list
, you will get
>>> l[:] = []
>>> sys.getsizeof(l)
72