Most Wanted Letter

I would like to give some feedback about the "Most Wanted Letter" Problem. You see, this is my solution so far: maxletters = [ord(text[i].lower()) for i in range(len(text)) if [sum([1 if k == l and l.islower() else 0 for k in text.lower()]) for l in text.lower()][i] == max([sum([1 if k == l and l.islower() else 0 for k in text.lower()]) for l in text.lower()])] maxletters.sort() return chr(max_letters[0]) but, when I press to test it, it never ends... I want to move on, and I know my solution works (so I don't want to change it), so what should I do?

From: http://www.checkio.org/station/home/

HTTP_USER_AGENT:

Mozilla/5.0 (Windows NT 6.3; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/44.0.2403.130 Safari/537.36