Run Detail
completedqwen3-14b30 answersRecorded for this video
Provider
openrouter
Challenge Version
v1.0
Turns
30
Duration
273.1s
Total Tokens
56,367
Input Tokens
3,924
Output Tokens
52,443
Reasoning Tokens
51,644
Reasoning Effort
default
Est. Cost
$0.0119
Started
11/4/2026, 9:40:07 PM
OR Provider
NextBit
Finish Reason
stop
Generation ID
gen-1793828544-Rr6EMw7Lbd22FztxDsnV
Turns (30)
Turn #1Raw score: 1
84 in64 out1 reasoning148 total1.5s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
if year % 4 != 0:
return False
elif year % 100 != 0:
return True
else:
return year % 400 == 0
Turn #2Raw score: 1
84 in64 out1 reasoning148 total1.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
if year % 4 != 0:
return False
elif year % 100 != 0:
return True
else:
return year % 400 == 0
Turn #3Raw score: 1
84 in64 out1 reasoning148 total1.5s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
if year % 4 != 0:
return False
elif year % 100 != 0:
return True
else:
return year % 400 == 0
Turn #4Raw score: 1
120 in104 out1 reasoning224 total2.2s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write rle(s: str) -> str to perform run-length encoding on s. Replace each run of consecutive identical characters with that character followed by the run length. rle("aaabcc") returns "a3b1c2" and rle("") returns "".
assistant
def rle(s: str) -> str:
if not s:
return ""
result = []
count = 1
for i in range(1, len(s)):
if s[i] == s[i - 1]:
count += 1
else:
result.append(s[i - 1] + str(count))
count = 1
result.append(s[-1] + str(count))
return "".join(result)
Turn #5Raw score: 1
120 in104 out1 reasoning224 total1.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write rle(s: str) -> str to perform run-length encoding on s. Replace each run of consecutive identical characters with that character followed by the run length. rle("aaabcc") returns "a3b1c2" and rle("") returns "".
assistant
def rle(s: str) -> str:
if not s:
return ""
result = []
count = 1
for i in range(1, len(s)):
if s[i] == s[i - 1]:
count += 1
else:
result.append(s[i - 1] + str(count))
count = 1
result.append(s[-1] + str(count))
return "".join(result)
Turn #6Raw score: 1
120 in104 out1 reasoning224 total1.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write rle(s: str) -> str to perform run-length encoding on s. Replace each run of consecutive identical characters with that character followed by the run length. rle("aaabcc") returns "a3b1c2" and rle("") returns "".
assistant
def rle(s: str) -> str:
if not s:
return ""
result = []
count = 1
for i in range(1, len(s)):
if s[i] == s[i - 1]:
count += 1
else:
result.append(s[i - 1] + str(count))
count = 1
result.append(s[-1] + str(count))
return "".join(result)
Turn #7Raw score: 1
115 in95 out1 reasoning210 total1.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write chunks(items, n: int) -> list[list]. items is an iterable, which may be a generator. Return consecutive lists of n elements, where the last list may be shorter. Raise ValueError when n is less than 1.
assistant
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
result = []
current_chunk = []
for item in items:
current_chunk.append(item)
if len(current_chunk) == n:
result.append(current_chunk)
current_chunk = []
if current_chunk:
result.append(current_chunk)
return result
Turn #8Raw score: 1
115 in95 out1 reasoning210 total1.8s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write chunks(items, n: int) -> list[list]. items is an iterable, which may be a generator. Return consecutive lists of n elements, where the last list may be shorter. Raise ValueError when n is less than 1.
assistant
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
result = []
current_chunk = []
for item in items:
current_chunk.append(item)
if len(current_chunk) == n:
result.append(current_chunk)
current_chunk = []
if current_chunk:
result.append(current_chunk)
return result
Turn #9Raw score: 1
115 in95 out1 reasoning210 total1.8s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write chunks(items, n: int) -> list[list]. items is an iterable, which may be a generator. Return consecutive lists of n elements, where the last list may be shorter. Raise ValueError when n is less than 1.
assistant
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
result = []
current_chunk = []
for item in items:
current_chunk.append(item)
if len(current_chunk) == n:
result.append(current_chunk)
current_chunk = []
if current_chunk:
result.append(current_chunk)
return result
Turn #10Raw score: 1
153 in4,749 out4,325 reasoning4,902 total88.5s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write round_half_up(value: str, digits: int) -> str. The string value represents a decimal number. Round it to digits decimal places, rounding exact ties away from zero based on the exact value written in value. Return a string with exactly digits decimal places, and omit the decimal point when digits is 0. round_half_up("2.675", 2) returns "2.68".
assistant
from decimal import Decimal, ROUND_HALF_UP
def round_half_up(value: str, digits: int) -> str:
num = Decimal(value)
if digits == 0:
rounded = num.quantize(Decimal('1'), rounding=ROUND_HALF_UP)
else:
pattern = Decimal('1.' + '0' * digits)
rounded = num.quantize(pattern, rounding=ROUND_HALF_UP)
return str(rounded)
Turn #11Raw score: 1
153 in5,272 out4,899 reasoning5,425 total98.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write round_half_up(value: str, digits: int) -> str. The string value represents a decimal number. Round it to digits decimal places, rounding exact ties away from zero based on the exact value written in value. Return a string with exactly digits decimal places, and omit the decimal point when digits is 0. round_half_up("2.675", 2) returns "2.68".
assistant
from decimal import Decimal, getcontext, ROUND_HALF_UP
def round_half_up(value: str, digits: int) -> str:
getcontext().rounding = ROUND_HALF_UP
num = Decimal(value)
if digits == 0:
pattern = Decimal('0')
else:
pattern = Decimal('0.' + '0' * digits)
rounded = num.quantize(pattern)
return str(rounded)
Turn #12Raw score: 1
153 in5,076 out4,800 reasoning5,229 total94.8s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write round_half_up(value: str, digits: int) -> str. The string value represents a decimal number. Round it to digits decimal places, rounding exact ties away from zero based on the exact value written in value. Return a string with exactly digits decimal places, and omit the decimal point when digits is 0. round_half_up("2.675", 2) returns "2.68".
assistant
from decimal import Decimal, getcontext, ROUND_HALF_UP
def round_half_up(value: str, digits: int) -> str:
getcontext().rounding = ROUND_HALF_UP
num = Decimal(value)
if digits == 0:
rounded = num.quantize(Decimal('1'))
else:
rounded = num.quantize(Decimal('1') / Decimal('10')**digits)
if digits == 0:
return format(rounded, 'f')
else:
return format(rounded, f'.{digits}f')
Turn #13Raw score: 0
148 in96 out1 reasoning244 total4.2s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write parse_kv(line: str) -> dict[str, str]. The string line contains key=value pairs separated by one or more spaces. A value may be enclosed in double quotes; if so, it may contain spaces and =, and the quotes are not included in the parsed value. A value may be empty, as in c=. If a key repeats, use the last value. Return {} for an empty line.
assistant
import re
def parse_kv(line: str) -> dict[str, str]:
result = {}
if not line:
return result
pairs = re.findall(r'(\w+)=(".*?"|\S+)', line)
for key, value in pairs:
if value.startswith('"') and value.endswith('"'):
value = value[1:-1]
result[key] = value
return result
Turn #14Raw score: 0
148 in151 out1 reasoning299 total5.8s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write parse_kv(line: str) -> dict[str, str]. The string line contains key=value pairs separated by one or more spaces. A value may be enclosed in double quotes; if so, it may contain spaces and =, and the quotes are not included in the parsed value. A value may be empty, as in c=. If a key repeats, use the last value. Return {} for an empty line.
assistant
import re
def parse_kv(line: str) -> dict[str, str]:
result = {}
tokens = re.findall(r'[^ ]+', line)
i = 0
while i < len(tokens):
if '=' in tokens[i]:
key, sep, value = tokens[i].partition('=')
if value and value[0] == '"':
value = value[1:]
if len(tokens) > i + 1 and tokens[i + 1][-1] == '"':
value += ' ' + tokens[i + 1][:-1]
i += 1
result[key] = value
i += 1
return result
Turn #15Raw score: 0
148 in8,000 out8,587 reasoning8,148 total143.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write parse_kv(line: str) -> dict[str, str]. The string line contains key=value pairs separated by one or more spaces. A value may be enclosed in double quotes; if so, it may contain spaces and =, and the quotes are not included in the parsed value. A value may be empty, as in c=. If a key repeats, use the last value. Return {} for an empty line.
Turn #16Raw score: 1
134 in125 out1 reasoning259 total2.2s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]. The input intervals may be in any order. Merge intervals that overlap or touch, so (1, 2) and (2, 3) become (1, 3). Return the merged intervals as tuples sorted by start, and leave the input list unchanged.
assistant
def merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]:
if not intervals:
return []
sorted_intervals = sorted(intervals, key=lambda x: x[0])
merged = [list(sorted_intervals[0])]
for current in sorted_intervals[1:]:
last = merged[-1]
if current[0] <= last[1]:
last[1] = max(last[1], current[1])
else:
merged.append(list(current))
return [tuple(interval) for interval in merged]
Turn #17Raw score: 1
134 in1,496 out1,368 reasoning1,630 total23.4s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]. The input intervals may be in any order. Merge intervals that overlap or touch, so (1, 2) and (2, 3) become (1, 3). Return the merged intervals as tuples sorted by start, and leave the input list unchanged.
assistant
def merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]:
sorted_intervals = sorted(intervals, key=lambda x: x[0])
if not sorted_intervals:
return []
merged = [sorted_intervals[0]]
for current in sorted_intervals[1:]:
last = merged[-1]
if current[0] <= last[1]:
new_start = last[0]
new_end = max(last[1], current[1])
merged[-1] = (new_start, new_end)
else:
merged.append(current)
return merged
Turn #18Raw score: 1
134 in125 out1 reasoning259 total2.5s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]. The input intervals may be in any order. Merge intervals that overlap or touch, so (1, 2) and (2, 3) become (1, 3). Return the merged intervals as tuples sorted by start, and leave the input list unchanged.
assistant
def merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]:
if not intervals:
return []
sorted_intervals = sorted(intervals, key=lambda x: x[0])
merged = [list(sorted_intervals[0])]
for current in sorted_intervals[1:]:
last = merged[-1]
if current[0] <= last[1]:
last[1] = max(last[1], current[1])
else:
merged.append(list(current))
return [tuple(interval) for interval in merged]
Turn #19Raw score: 0
110 in113 out1 reasoning223 total4.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write add_months(d: datetime.date, months: int) -> datetime.date to add months calendar months to d. months may be negative. If the day does not exist in the target month, use the last day of that month.
assistant
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
month = d.month - 1 + months
year = d.year + month // 12
month = month % 12 + 1
day = d.day
if day > 28:
day = min(d.day, datetime.date(year, month, 1).replace(month=month, day=1).month)
return datetime.date(year, month, day)
Turn #20Raw score: 0
110 in103 out1 reasoning213 total2.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write add_months(d: datetime.date, months: int) -> datetime.date to add months calendar months to d. months may be negative. If the day does not exist in the target month, use the last day of that month.
assistant
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
month = d.month - 1 + months
year = d.year + month // 12
month = month % 12 + 1
day = d.day
try:
return datetime.date(year, month, day)
except ValueError:
return datetime.date(year, month, 1) - datetime.timedelta(days=1)
Turn #21Raw score: 0
110 in133 out1 reasoning243 total2.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write add_months(d: datetime.date, months: int) -> datetime.date to add months calendar months to d. months may be negative. If the day does not exist in the target month, use the last day of that month.
assistant
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
month = d.month - 1 + months
year = d.year + month // 12
month = month % 12 + 1
day = d.day
if day > datetime.date(year, month, 1).replace(day=1, month=month, year=year).month:
day = datetime.date(year, month, 1).replace(day=1, month=month, year=year).day
return datetime.date(year, month, day)
Turn #22Raw score: 1
134 in2,019 out2,083 reasoning2,153 total31.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write top_k_words(text: str, k: int) -> list[tuple[str, int]]. A word is a maximal sequence of ASCII letters and apostrophes. Words compare case-insensitively and are returned in lowercase. Return the k most frequent words as (word, count) tuples, sorted by highest count first, breaking ties alphabetically by word.
assistant
import re
from collections import Counter
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
words = re.findall(r"[a-zA-Z']+", text)
words = [w.lower() for w in words]
counts = Counter(words)
sorted_counts = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return sorted_counts[:k]
Turn #23Raw score: 0
134 in2,765 out2,816 reasoning2,899 total43.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write top_k_words(text: str, k: int) -> list[tuple[str, int]]. A word is a maximal sequence of ASCII letters and apostrophes. Words compare case-insensitively and are returned in lowercase. Return the k most frequent words as (word, count) tuples, sorted by highest count first, breaking ties alphabetically by word.
assistant
import re
from collections import Counter
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
words = re.findall(r'[a-zA-Z']+', text)
normalized = [w.lower() for w in words]
counts = Counter(normalized)
sorted_counts = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return sorted_counts[:k]
Turn #24Raw score: 1
134 in111 out1 reasoning245 total2.0s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write top_k_words(text: str, k: int) -> list[tuple[str, int]]. A word is a maximal sequence of ASCII letters and apostrophes. Words compare case-insensitively and are returned in lowercase. Return the k most frequent words as (word, count) tuples, sorted by highest count first, breaking ties alphabetically by word.
assistant
import re
from collections import defaultdict
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
word_pattern = re.compile(r"[a-zA-Z']+")
counts = defaultdict(int)
for word in word_pattern.findall(text):
lower_word = word.lower()
counts[lower_word] += 1
sorted_words = sorted(counts.items(), key=lambda x: (-x[1], x[0]))
return sorted_words[:k]
Turn #25Raw score: 0
170 in162 out1 reasoning332 total2.8s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write flatten(obj: dict, sep: str = ".") -> dict. Flatten nested dicts and lists into a single level, joining keys with sep and using list indices as keys. Keep an empty dict or empty list as the value at its key. flatten({"a": {"b": 1}, "c": [{"d": 2}, 3], "e": {}}) returns {"a.b": 1, "c.0.d": 2, "c.1": 3, "e": {}}.
assistant
def flatten(obj: dict, sep: str = ".") -> dict:
def _flatten(d: dict, prefix: str = "") -> dict:
result = {}
for k, v in d.items():
new_key = prefix + k if prefix else k
if isinstance(v, dict):
result.update(_flatten(v, new_key + sep))
elif isinstance(v, list):
for i, item in enumerate(v):
if isinstance(item, dict):
result.update(_flatten(item, f"{new_key}{sep}{i}"))
else:
result[f"{new_key}{sep}{i}"] = item
else:
result[new_key] = v
return result
return _flatten(obj)
Turn #26Raw score: 0
170 in8,000 out9,135 reasoning8,170 total139.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write flatten(obj: dict, sep: str = ".") -> dict. Flatten nested dicts and lists into a single level, joining keys with sep and using list indices as keys. Keep an empty dict or empty list as the value at its key. flatten({"a": {"b": 1}, "c": [{"d": 2}, 3], "e": {}}) returns {"a.b": 1, "c.0.d": 2, "c.1": 3, "e": {}}.
Turn #27Raw score: 0
170 in7,694 out7,748 reasoning7,864 total136.0s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write flatten(obj: dict, sep: str = ".") -> dict. Flatten nested dicts and lists into a single level, joining keys with sep and using list indices as keys. Keep an empty dict or empty list as the value at its key. flatten({"a": {"b": 1}, "c": [{"d": 2}, 3], "e": {}}) returns {"a.b": 1, "c.0.d": 2, "c.1": 3, "e": {}}.
assistant
def flatten(obj: dict, sep: str = ".") -> dict:
result = {}
def _flatten(current_obj, current_path):
if isinstance(current_obj, dict):
if not current_obj:
result[sep.join(current_path)] = current_obj
return
for key, value in current_obj.items():
new_path = current_path + [key]
if isinstance(value, dict):
_flatten(value, new_path)
elif isinstance(value, list):
for i, item in enumerate(value):
new_path_with_index = new_path + [str(i)]
if isinstance(item, (dict, list)):
_flatten(item, new_path_with_index)
else:
result[sep.join(new_path_with_index)] = item
else:
result[sep.join(new_path)] = value
elif isinstance(current_obj, list):
if not current_obj:
result[sep.join(current_path)] = current_obj
return
for i, item in enumerate(current_obj):
new_path = current_path + [str(i)]
if isinstance(item, (dict, list)):
_flatten(item, new_path)
else:
result[sep.join(new_path)] = item
_flatten(obj, [])
return result
Turn #28Raw score: 1
140 in5,208 out5,863 reasoning5,348 total92.3s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write lru(maxsize: int), a decorator factory that caches a function's results by its positional arguments without using functools.lru_cache or functools.cache. It stores at most maxsize results. When the cache is full, evict the least recently used result. A cache hit counts as a use. The decorated function must preserve its original __name__.
assistant
from collections import OrderedDict
def lru(maxsize: int):
def decorator(func):
if maxsize <= 0:
return func
cache = OrderedDict()
def wrapper(*args, **kwargs):
key = args
if key in cache:
cache.move_to_end(key)
return cache[key]
else:
result = func(*args, **kwargs)
if len(cache) >= maxsize:
cache.popitem(last=False)
cache[key] = result
return result
wrapper.__name__ = func.__name__
return wrapper
return decorator
Turn #29Raw score: 1
140 in128 out1 reasoning268 total2.2s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write lru(maxsize: int), a decorator factory that caches a function's results by its positional arguments without using functools.lru_cache or functools.cache. It stores at most maxsize results. When the cache is full, evict the least recently used result. A cache hit counts as a use. The decorated function must preserve its original __name__.
assistant
def lru(maxsize: int):
def decorator(func):
cache = {}
lru_order = []
def wrapper(*args):
if args in cache:
lru_order.remove(args)
lru_order.append(args)
return cache[args]
if len(cache) >= maxsize:
least_used = lru_order.pop(0)
del cache[least_used]
lru_order.append(args)
cache[args] = func(*args)
return cache[args]
wrapper.__name__ = func.__name__
return wrapper
return decorator
Turn #30Raw score: 1
140 in128 out1 reasoning268 total2.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write lru(maxsize: int), a decorator factory that caches a function's results by its positional arguments without using functools.lru_cache or functools.cache. It stores at most maxsize results. When the cache is full, evict the least recently used result. A cache hit counts as a use. The decorated function must preserve its original __name__.
assistant
def lru(maxsize: int):
def decorator(func):
cache = {}
lru_order = []
def wrapper(*args):
if args in cache:
lru_order.remove(args)
lru_order.append(args)
return cache[args]
if len(cache) >= maxsize:
least_used = lru_order.pop(0)
del cache[least_used]
lru_order.append(args)
cache[args] = func(*args)
return cache[args]
wrapper.__name__ = func.__name__
return wrapper
return decorator