Palindrome

import fileinput


def longestPalindrome(s):
    string = "#" + "#".join(s) + "#"
    i = 0
    mxb = 0
    mxc = 0
    p = [0] * len(string)
    res = [0, 0]

    while i < len(string):
        if mxb > i:
            p[i] = min(p[2 * mxc - i], mxb - i)

        else:
            p[i] = 1

        while i - p[i] >= 0 and i + p[i] < len(string) and string[i - p[i]] == string[i + p[i]]:
            p[i] += 1

        if mxb < p[i] + i:
            mxb = p[i] + i
            mxc = i
            if mxb - mxc > res[1] - res[0]:
                res = [mxc, mxb]

        i += 1

    return "".join([x for x in string[2 * res[0] - res[1] + 1:res[1]] if x != '#'])

for line in fileinput.input(['-']):
    seq = line
    print(longestPalindrome(seq))

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED