3

import time, requests, concurrent.futures as cf

start_time = time.time()

f = open("usernames.txt", "a")
f.truncate() # clear file contents

CONNECTIONS = 20

def get_usernames():
    my_list = []

    alphabet = "abcdefghijklmnopqrstuvwxyz1234567890-_"
    alphabet1 = "opqrstuvwxyz1234567890-_"
    onlyletters = "abcdefghijklmnopqrstuvwxyz"
    nums = "1234567890"
    other = "-_"

    for l1 in alphabet1:
        for l2 in alphabet:
            for l3 in alphabet:
                user = l1 + l2 + l3
                if not (l1 in onlyletters and l2 in onlyletters and l3 in onlyletters) and not (l1 in other and l2 in other and l3 in other) and not (l1 in nums and l2 in nums and l3 in nums):
                    my_list.append(user)
    return my_list

def check_username(username):
    return requests.get(f'https://api.scratch.mit.edu/accounts/checkusername/{username}/').text != '{"username":"' + username + '","msg":"valid username"}'

usernames = get_usernames()

available_usernames = []
combinations = 25540 # it's actually 25536 but we round it up to 25540 because we can divide 25540 by 10
counter = 0
with cf.ThreadPoolExecutor(max_workers = CONNECTIONS) as executor:
    future_to_url = {executor.submit(check_username, username): username for username in usernames}
    for future in cf.as_completed(future_to_url):
        counter += 1
        if counter % (combinations / 10) == 0:
            print(str(int((counter / combinations) * 100)) + " % done")
        username = future_to_url[future]
        if not future.result():
            available_usernames.append(username)

print("100 % done")

available_usernames = sorted(available_usernames, key = lambda word: ["abcdefghijklmnopqrstuvwxyz1234567890-_".index(char) for char in word])

for item in available_usernames:
    f.write(item + "\n")

print("\n" + "Execution time: " + str(round(((time.time() - start_time)/60), 3)) + " minutes")