Оптимизация кода

kol=0
N=int(input())
teach_list=[]
for i in range(N):
    teach_list.append(input())
teach_list1 = []
for s in teach_list :
    if s not in teach_list1 :
         teach_list1.append(s)
M=int(input())
student_list=[]
for j in range(M):
    student_list.append(input())
for i in range(len(teach_list1)):
    for j in range(M):
        if teach_list1[i]==student_list[j]:
            kol+=1
print(kol)

for teach in set(teach_list):
    kol += student_list.count(teach)

kol=0
N=int(input())
teach_list=[]
for i in range(N):
    teach_list.append(input())
M=int(input())
student_list=[]
for j in range(M):
    student_list.append(input())
for teach in set(teach_list):
    kol += student_list.count(teach)
print(kol)

teach_list = {input() for _ in range(int(input('Кол-во учителей: ')))}
print(sum(1 for _ in range(int(input('Кол-во студентов: '))) if input() in teach_list))

teach_list = [input() for _ in range(int(input('Кол-во учителей: ')))]  
student_list = [input() for _ in range(int(input('Кол-во студентов: ')))]
 
count = 0
for teach in set(teach_list):
    count += student_list.count(teach)
print(count)

teach_list = {int(input()) for _ in range(int(input('Кол-во учителей: ')))}
print(sum(1 for _ in range(int(input('Кол-во студентов: '))) if int(input()) in teach_list))

def c_key(my_dir, key):
    try:
        return my_dir[key]
    except:
        return 0
teach_list = {input():1 for _ in range(int(input('Дат у учителя: ')))}
print(sum(c_key(teach_list, input()) for _ in range(int(input('Дат у студента: '))))

from random import randint
from collections import Counter
 
teach_list = sorted([randint(1, 20) for _ in range(1, 15)])
stud_list = [randint(1, 20) for _ in range(1, 15)]
tl, sl = Counter(teach_list), Counter(stud_list)
print(sum((tl & sl).values()))

teach_list = dict((int(input()), 1) for _ in range(int(input('Дат у учителя: '))))

import sys
sys.version