Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
s_list = []
S_list = []
for i in range(N):
  s = str(input())
  if len(s)<=5:
    if not (s in s_list):
      s_list.append(s)
  else:
    if not (s in S_list):
      S_list.append(s)
print(len(s_list)+len(S_list))

Fixed submission:
import numpy as np
N=int(input())
S_list = np.zeros(N)
#S_list = np.zeros(N,dtype=str)
e_list = "abcdefghijklmnopqrstuvwxyz"

for i in range(N):
  s = input()
  n = 0
  for k in range(len(s)):
    n = n + (e_list.index(s[k])+1)*(100**k)
  S_list[i] = n
print(len(np.unique(S_list)))

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
a_list = []
b_list = []
c_list = []
d_list = []
e_list = []
f_list = []
g_list = []
h_list = []
i_list = []
j_list = []
k_list = []
l_list = []
m_list = []
n_list = []
o_list = []
p_list = []
q_list = []
r_list = []
s_list = []
t_list = []
u_list = []
v_list = []
w_list = []
x_list = []
y_list = []
z_list = []
for i in range(N):
  s = input()
  if s[0] == "a":
    if not s in a_list:
      a_list.append(s)
  if s[0] == "b":
    if not s in b_list:
      b_list.append(s)
  if s[0] == "c":
    if not s in c_list:
      c_list.append(s)
  if s[0] == "d":
    if not s in d_list:
      d_list.append(s)
  if s[0] == "e":
    if not s in e_list:
      e_list.append(s)
  if s[0] == "f":
    if not s in f_list:
      f_list.append(s)
  if s[0] == "g":
    if not s in g_list:
      g_list.append(s)
  if s[0] == "h":
    if not s in h_list:
      h_list.append(s)
  if s[0] == "i":
    if not s in i_list:
      i_list.append(s)
  if s[0] == "j":
    if not s in j_list:
      j_list.append(s)
  if s[0] == "k":
    if not s in k_list:
      k_list.append(s)
  if s[0] == "l":
    if not s in l_list:
      l_list.append(s)
  if s[0] == "m":
    if not s in m_list:
      m_list.append(s)
  if s[0] == "n":
    if not s in n_list:
      n_list.append(s)
  if s[0] == "o":
    if not s in o_list:
      o_list.append(s)
  if s[0] == "p":
    if not s in p_list:
      p_list.append(s)
  if s[0] == "q":
    if not s in q_list:
      q_list.append(s)
  if s[0] == "r":
    if not s in r_list:
      r_list.append(s)
  if s[0] == "s":
    if not s in s_list:
      s_list.append(s)
  if s[0] == "t":
    if not s in t_list:
      t_list.append(s)
  if s[0] == "u":
    if not s in u_list:
      u_list.append(s)
  if s[0] == "v":
    if not s in v_list:
      v_list.append(s)
  if s[0] == "w":
    if not s in w_list:
      w_list.append(s)
  if s[0] == "x":
    if not s in x_list:
      x_list.append(s)
  if s[0] == "y":
    if not s in y_list:
      y_list.append(s)
  if s[0] == "z":
    if not s in z_list:
      z_list.append(s)
count = len(a_list)
count = count + len(b_list)
count = count + len(c_list)
count = count + len(d_list)
count = count + len(e_list)
count = count + len(f_list)
count = count + len(g_list)
count = count + len(h_list)
count = count + len(i_list)
count = count + len(j_list)
count = count + len(k_list)
count = count + len(l_list)
count = count + len(m_list)
count = count + len(n_list)
count = count + len(o_list)
count = count + len(p_list)
count = count + len(q_list)
count = count + len(r_list)
count = count + len(s_list)
count = count + len(t_list)
count = count + len(u_list)
count = count + len(v_list)
count = count + len(w_list)
count = count + len(x_list)
count = count + len(y_list)
count = count + len(z_list)
print(count)

Fixed submission:
import numpy as np
N=int(input())
S_list = np.zeros(N)
#S_list = np.zeros(N,dtype=str)
e_list = "abcdefghijklmnopqrstuvwxyz"

for i in range(N):
  s = input()
  n = 0
  for k in range(len(s)):
    n = n + (e_list.index(s[k])+1)*(100**k)
  S_list[i] = n
print(len(np.unique(S_list)))

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
S_list = []
count = 0
for i in range(N):
  s = str(input())
  if not (s in S_list):
    count = count + 1
  S_list.append(s)
print(count)


Fixed submission:
import numpy as np
N=int(input())
S_list = np.zeros(N)
#S_list = np.zeros(N,dtype=str)
e_list = "abcdefghijklmnopqrstuvwxyz"

for i in range(N):
  s = input()
  n = 0
  for k in range(len(s)):
    n = n + (e_list.index(s[k])+1)*(100**k)
  S_list[i] = n
print(len(np.unique(S_list)))

Buggy python submission (verdict: Runtime Error):
N=int(input())
S_list = []
for i in range(N):
  s = str(input())
  if not (s in S_list):
#    S_list.append(s)
print(len(S_list))

Fixed submission:
import numpy as np
N=int(input())
S_list = np.zeros(N)
#S_list = np.zeros(N,dtype=str)
e_list = "abcdefghijklmnopqrstuvwxyz"

for i in range(N):
  s = input()
  n = 0
  for k in range(len(s)):
    n = n + (e_list.index(s[k])+1)*(100**k)
  S_list[i] = n
print(len(np.unique(S_list)))

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
S_list = []
for i in range(N):
  s = str(input())
  if not (s in S_list):
    S_list.append(s)
print(len(S_list))

Fixed submission:
import numpy as np
N=int(input())
S_list = np.zeros(N)
#S_list = np.zeros(N,dtype=str)
e_list = "abcdefghijklmnopqrstuvwxyz"

for i in range(N):
  s = input()
  n = 0
  for k in range(len(s)):
    n = n + (e_list.index(s[k])+1)*(100**k)
  S_list[i] = n
print(len(np.unique(S_list)))