Modify the following Python program to make it run faster by optimizing the code.
# This code takes a list of integers and finds the 2nd biggest
def find_2nd_largest(l):
  biggest = -1
  2nd_biggest = -1
  for i in l:
    if i > biggest:
      2nd_biggest = biggest
      biggest = i
    elif i > 2nd_biggest:
      2nd_biggest = i
  return 2nd_biggest
def find_2nd_largest(l):
  biggest = max(l)
  l.remove(biggest)
  2nd_biggest = max(l)
  return 2nd_biggest