Given a lowercase string that has alphabetic characters only and no spaces, return the highest value of consonant substrings. Consonants are any letters of the alphabet except `"aeiou"`. 
We shall assign the following values: `a = 1, b = 2, c = 3, .... z = 26`.
For example, for the word "zodiacs", let's cross out the vowels. We get: "z **~~o~~** d **~~ia~~** cs"
For C: do not mutate input.
More examples in test cases. Good luck!
If you like this Kata, please try:
[Word values](https://www.codewars.com/kata/598d91785d4ce3ec4f000018)
[Vowel-consonant lexicon](https://www.codewars.com/kata/59cf8bed1a68b75ffb000026)
import re

CONS_PAT = re.compile(r"[^aeiuo]+")

def solve(s):
    return max(sum(map(lambda c: ord(c)-96, conss)) for conss in CONS_PAT.findall(s))
import re

CONS_PAT = re.compile(r"[^aeiuo]+")

def solve(s):
    return max(sum(map(lambda c: ord(c)-96, conss)) for conss in CONS_PAT.findall(s))