<SYSTEM_TASK:>
Given the following text description, write Python code to implement the functionality described below step by step
<END_TASK>
<USER_TASK:>
Description:
 Day 14
Step1:  Hash index
To prevent the same hash from being counted upon again and again, we maintain a hash index to store the hashes of indexes. We also trim the index to remove any index for keys lower than the current key since we do not require those.
Step2:  Part Two
Of course, in order to make this process even more secure, you've also implemented key stretching.
Key stretching forces attackers to spend more time generating hashes. Unfortunately, it forces everyone else to spend more time, too.
To implement key stretching, whenever you generate a hash, before you use it, you first find the MD5 hash of that hash, then the MD5 hash of that hash, and so on, a total of 2016 additional hashings. Always use lowercase hexadecimal representations of hashes.
For example, to find the stretched hash for index 0 and salt abc
<ASSISTANT_TASK:>
Python Code:
import re
three_repeating_characters = re.compile(r'(.)\1{2}')
with open('../inputs/day14.txt', 'r') as f:
    salt = f.readline().strip()
    # TEST DATA
    # salt = 'abc'
print(salt)
Explanation: Day 14: One-Time Pad
author: Harshvardhan Pandit
license: MIT
link to problem statement
In order to communicate securely with Santa while you're on this mission, you've been using a one-time pad that you generate using a pre-agreed algorithm. Unfortunately, you've run out of keys in your one-time pad, and so you need to generate some more.
To generate keys, you first get a stream of random data by taking the MD5 of a pre-arranged [salt](https://en.wikipedia.org/wiki/Salt_(cryptography) (your puzzle input) and an increasing integer index (starting with 0, and represented in decimal); the resulting MD5 hash should be represented as a string of lowercase hexadecimal digits.
However, not all of these MD5 hashes are keys, and you need 64 new keys for your one-time pad. A hash is a key only if:
It contains three of the same character in a row, like 777. Only consider the first such triplet in a hash.
One of the next 1000 hashes in the stream contains that same character five times in a row, like 77777.
Considering future hashes for five-of-a-kind sequences does not cause those hashes to be skipped; instead, regardless of whether the current hash is a key, always resume testing for keys starting with the very next hash.
For example, if the pre-arranged salt is abc:
The first index which produces a triple is 18, because the MD5 hash of abc18 contains ...cc38887a5.... However, index 18 does not count as a key for your one-time pad, because none of the next thousand hashes (index 19 through index 1018) contain 88888.
The next index which produces a triple is 39; the hash of abc39 contains eee. It is also the first key: one of the next thousand hashes (the one at index 816) contains eeeee.
None of the next six triples are keys, but the one after that, at index 92, is: it contains 999 and index 200 contains 99999.
Eventually, index 22728 meets all of the criteria to generate the 64th key.
So, using our example salt of abc, index 22728 produces the 64th key.
Given the actual salt in your puzzle input, what index produces your 64th one-time pad key?
Solution logic
Our salt is out input, we apply it increasingly to integers, take their MD5 hash, and if it contains a character repeating three times, we check if there is a hash in the next 1000 integers that features the same character 7 times, and if it does, then the integer we had is our key. Find 64 such keys, with the index of the 64th key being the answer. Seems simple and straightforward.
End of explanation
import hashlib
hash_index= {}
def get_hash_string(key):
    if key in hash_index:
        return hash_index[key]
    string = '{salt}{key}'.format(salt=salt, key=key)
    md5 = hashlib.md5()
    md5.update(string.encode('ascii'))
    hashstring = md5.hexdigest()
    hash_index[key] = hashstring
    return hashstring
def run():
    keys = []
    current_key = 0
    while(len(keys) < 64):
        for i in range(0, current_key):
            hash_index.pop(i, None)
        hashstring = get_hash_string(current_key)
        repeating_chacter = three_repeating_characters.findall(hashstring)
        if not repeating_chacter:
            current_key += 1
            continue
        repeating_chacter = repeating_chacter[0]
        repeating_character_five = ''.join(repeating_chacter for i in range(0, 5))
        for qualifying_index in range(current_key + 1, current_key + 1001):
            hashstring = get_hash_string(qualifying_index)
            if repeating_character_five in hashstring:
                break
        else:
            current_key += 1
            continue
        keys.append(current_key)
        print(len(keys), current_key)
        current_key += 1
    return keys
print('answer', run()[63])
Explanation: Hash index
To prevent the same hash from being counted upon again and again, we maintain a hash index to store the hashes of indexes. We also trim the index to remove any index for keys lower than the current key since we do not require those.
End of explanation
hash_index = {}
def get_hash_string(key):
    if key in hash_index:
        return hash_index[key]
    string = '{salt}{key}'.format(salt=salt, key=key)
    md5 = hashlib.md5()
    md5.update(string.encode('ascii'))
    hashstring = md5.hexdigest()
    # PART TWO
    for i in range(0, 2016):
        md5 = hashlib.md5()
        md5.update(hashstring.encode('ascii'))
        hashstring = md5.hexdigest()
    hash_index[key] = hashstring
    return hashstring
print('answer', run()[63])
Explanation: Part Two
Of course, in order to make this process even more secure, you've also implemented key stretching.
Key stretching forces attackers to spend more time generating hashes. Unfortunately, it forces everyone else to spend more time, too.
To implement key stretching, whenever you generate a hash, before you use it, you first find the MD5 hash of that hash, then the MD5 hash of that hash, and so on, a total of 2016 additional hashings. Always use lowercase hexadecimal representations of hashes.
For example, to find the stretched hash for index 0 and salt abc:
Find the MD5 hash of abc0: 577571be4de9dcce85a041ba0410f29f.
Then, find the MD5 hash of that hash: eec80a0c92dc8a0777c619d9bb51e910.
Then, find the MD5 hash of that hash: 16062ce768787384c81fe17a7a60c7e3.
...repeat many times...
Then, find the MD5 hash of that hash: a107ff634856bb300138cac6568c0f24.
So, the stretched hash for index 0 in this situation is a107ff.... In the end, you find the original hash (one use of MD5), then find the hash-of-the-previous-hash 2016 times, for a total of 2017 uses of MD5.
The rest of the process remains the same, but now the keys are entirely different. Again for salt abc:
The first triple (222, at index 5) has no matching 22222 in the next thousand hashes.
The second triple (eee, at index 10) hash a matching eeeee at index 89, and so it is the first key.
Eventually, index 22551 produces the 64th key (triple fff with matching fffff at index 22859.
Given the actual salt in your puzzle input and using 2016 extra MD5 calls of key stretching, what index now produces your 64th one-time pad key?
Solution logic
We only need to change the definition of get_hash_string to calculate the hash 2016 times more. And then simply run the algorithm again. 
To prevent computationally intensive operations from repeating themselves, we maintain an index of hashes so that we can easily lookup indexes without needing to calculate their hashes.
End of explanation
<END_TASK>