Поиск преобладающего элемента в последовательности

a = 0
c = 0
lm = int(input())
while lm != 0:
    if c == 0:
        a = lm
        c += 1
    elif lm == a:
        c += 1
    else:
        c = c - 1
print(a)

>>> Counter([random.randint(1,10)for i in range(100000)]).most_common(1)
[(7, 10195)]
>>> Counter([random.randint(1,10)for i in range(100000)]).most_common(1)
[(8, 10158)]
>>> Counter([random.randint(1,10)for i in range(100000)]).most_common(1)
[(8, 10161)]
>>> Counter([random.randint(1,10)for i in range(100000)]).most_common(1)
[(8, 10170)]
>>>

# -*- mode: python 3.8.1 ; encoding: utf-8 -*-
from collections import Counter
 
 
print(Counter((data := lambda: [x] if (x := int(input())) == 0 else (x, *data()))()).most_common(1))

def maxcount(arr):
    arr_s = sorted(arr)
    num, maximum, i = None, 0, 0
    while i < len(arr_s):
        j = i
        tmp = 0
        while j < len(arr_s):
            if arr_s[j] == arr_s[i]:
                tmp+=1
                j +=1
            else:
                break
        if tmp > maximum:
            maximum, num = tmp, arr_s[i]
        i = j
    return num, maximum

s1=int(input())
f1=1
s2=0
f2=0
while(True):
    c=int(input())
    if c==0:
        break
    if c==s1:
        f1+=1
    elif c==s2:
        f2+=1
    elif s2==0:
        s2=c
        f2=1
    if f2>f1:
        s1,s2=s2,s1
        f1,f2=f2,f1
        
print(s1)

mx = cur = int(input())
k = 1
while cur != 0:
     cur = int(input())
     if cur != 0:
          k += [-1, 1][mx == cur]
          if k == 0:
               mx = cur
               k = 1
print(mx)

mx = cur = int(input())
k = 1
while cur != 0:
    cur = int(input())
    if cur != 0:
        if mx == cur:
            k += 1
        else:
            k -= 1
        if k == 0:
            mx = cur
            k = 1
print(mx)