Run Detail
completedripple-65b-preview30 answersRecorded for these videos
Provider
openrouter
Challenge Version
v1.0
Turns
30
Duration
307.3s
Total Tokens
94,716
Input Tokens
3,855
Output Tokens
90,861
Reasoning Effort
default
Cached Input Tokens
1,728
Est. Cost
$0.0550
Started
11/5/2026, 3:06:11 AM
OR Provider
GMICloud
Finish Reason
stop
Generation ID
gen-1793848215-KCtQeI6ptyC4AoeaWqQC
Turns (30)
Turn #1Raw score: 1
82 in161 out243 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 is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
return year % 4 == 0 and (year % 100 != 0 or year % 400 == 0)
Turn #2Raw score: 1
82 in43 out64 cached125 total3.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:
return year % 4 == 0 and (year % 100 != 0 or year % 400 == 0)
Turn #3Raw score: 1
82 in43 out64 cached125 total3.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 is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
return year % 4 == 0 and (year % 100 != 0 or year % 400 == 0)
Turn #4Raw score: 1
118 in320 out438 total6.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
from itertools import groupby
def rle(s: str) -> str:
return "".join(f"{char}{len(list(group))}" for char, group in groupby(s))
Turn #5Raw score: 1
118 in176 out64 cached294 total6.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 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
from itertools import groupby
def rle(s: str) -> str:
return "".join(char + str(len(list(group))) for char, group in groupby(s))
Turn #6Raw score: 1
118 in289 out64 cached407 total8.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
from itertools import groupby
def rle(s: str) -> str:
return "".join(ch + str(len(list(group))) for ch, group in groupby(s))
Turn #7Raw score: 1
113 in290 out403 total7.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 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 greater than or equal to 1")
result = []
current = []
for item in items:
current.append(item)
if len(current) == n:
result.append(current)
current = []
if current:
result.append(current)
return result
Turn #8Raw score: 1
113 in270 out64 cached383 total6.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 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
from itertools import islice
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
iterator = iter(items)
return [list(islice(iterator, n)) for _ in iter(int, 1) if _]
Wait, that list comprehension with iter(int, 1) is weird and would never terminate properly. Let me write it correctly.
from itertools import islice
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
iterator = iter(items)
result = []
while True:
chunk = list(islice(iterator, n))
if not chunk:
break
result.append(chunk)
return result
from itertools import islice
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
iterator = iter(items)
result: list[list] = []
while True:
chunk = list(islice(iterator, n))
if not chunk:
break
result.append(chunk)
return result
Turn #9Raw score: 1
113 in85 out64 cached198 total4.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 = []
buffer = []
for item in items:
buffer.append(item)
if len(buffer) == n:
result.append(buffer)
buffer = []
if buffer:
result.append(buffer)
return result
Turn #10Raw score: 1
148 in14,646 out14,794 total174.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 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, localcontext
def round_half_up(value: str, digits: int) -> str:
with localcontext() as ctx:
ctx.prec = max(28, len(value) + abs(digits) + 10)
d = Decimal(value)
quant = Decimal(1).scaleb(-digits)
rounded = d.quantize(quant, rounding=ROUND_HALF_UP)
return f"{rounded:.{digits}f}"
Turn #11Raw score: 0
148 in14,745 out14,893 total161.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 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".
Turn #12Raw score: 0
148 in14,745 out128 cached14,893 total131.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 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".
Turn #13Raw score: 1
146 in5,241 out5,387 total82.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
def parse_kv(line: str) -> dict[str, str]:
result: dict[str, str] = {}
i = 0
n = len(line)
while i < n:
while i < n and line[i].isspace():
i += 1
if i >= n:
break
start = i
while i < n and line[i] != '=' and not line[i].isspace():
i += 1
if i >= n or line[i] != '=':
while i < n and not line[i].isspace():
i += 1
continue
key = line[start:i]
i += 1
if i < n and line[i] == '"':
i += 1
start = i
while i < n and line[i] != '"':
i += 1
value = line[start:i]
if i < n:
i += 1
else:
start = i
while i < n and not line[i].isspace():
i += 1
value = line[start:i]
result[key] = value
return result
Turn #14Raw score: 1
146 in3,635 out128 cached3,781 total60.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
def parse_kv(line: str) -> dict[str, str]:
result: dict[str, str] = {}
i = 0
n = len(line)
while i < n:
while i < n and line[i].isspace():
i += 1
if i >= n:
break
key_start = i
while i < n and line[i] != '=':
i += 1
if i >= n:
break
key = line[key_start:i]
i += 1
if i < n and line[i] == '"':
i += 1
value_start = i
while i < n and line[i] != '"':
i += 1
value = line[value_start:i]
if i < n:
i += 1
else:
value_start = i
while i < n and not line[i].isspace():
i += 1
value = line[value_start:i]
result[key] = value
return result
Turn #15Raw score: 1
146 in8,274 out128 cached8,420 total105.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
def parse_kv(line: str) -> dict[str, str]:
result: dict[str, str] = {}
i = 0
n = len(line)
while i < n:
while i < n and line[i].isspace():
i += 1
if i >= n:
break
start = i
while i < n and line[i] != '=' and not line[i].isspace():
i += 1
if i >= n or line[i] != '=':
break
key = line[start:i]
i += 1
if i < n and line[i] == '"':
i += 1
chars = []
while i < n:
if line[i] == '\\' and i + 1 < n and line[i + 1] == '"':
chars.append('"')
i += 2
elif line[i] == '"':
i += 1
break
else:
chars.append(line[i])
i += 1
value = ''.join(chars)
else:
start_val = i
while i < n and not line[i].isspace():
i += 1
value = line[start_val:i]
result[key] = value
return result
Turn #16Raw score: 1
132 in121 out253 total15.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 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 []
ordered = sorted(intervals, key=lambda pair: pair[0])
merged = [list(ordered[0])]
for start, end in ordered[1:]:
if start <= merged[-1][1]:
if end > merged[-1][1]:
merged[-1][1] = end
else:
merged.append([start, end])
return [tuple(pair) for pair in merged]
Turn #17Raw score: 1
132 in448 out128 cached580 total16.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 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 []
ordered = sorted(intervals)
merged = [ordered[0]]
for start, end in ordered[1:]:
last_start, last_end = merged[-1]
if start <= last_end:
if end > last_end:
merged[-1] = (last_start, end)
else:
merged.append((start, end))
return merged
Turn #18Raw score: 1
132 in141 out128 cached273 total16.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 []
ordered = sorted(intervals)
merged: list[tuple[int, int]] = [ordered[0]]
for start, end in ordered[1:]:
last_start, last_end = merged[-1]
if start <= last_end:
if end > last_end:
merged[-1] = (last_start, end)
else:
merged.append((start, end))
return merged
Turn #19Raw score: 1
108 in1,989 out2,097 total35.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 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 calendar
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
total = d.month - 1 + months
year = d.year + total // 12
month = total % 12 + 1
last_day = calendar.monthrange(year, month)[1]
return datetime.date(year, month, min(d.day, last_day))
Turn #20Raw score: 1
108 in2,681 out2,789 total37.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 calendar
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
total = d.year * 12 + (d.month - 1) + months
year, month_index = divmod(total, 12)
month = month_index + 1
last_day = calendar.monthrange(year, month)[1]
return datetime.date(year, month, min(d.day, last_day))
Turn #21Raw score: 1
108 in881 out64 cached989 total23.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 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 calendar
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
total = d.month - 1 + months
year = d.year + total // 12
month = total % 12 + 1
day = min(d.day, calendar.monthrange(year, month)[1])
return datetime.date(year, month, day)
Turn #22Raw score: 1
132 in828 out960 total15.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 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]]:
if k <= 0:
return []
words = [word.lower() for word in re.findall(r"[A-Za-z']+", text)]
counts = Counter(words)
return sorted(counts.items(), key=lambda item: (-item[1], item[0]))[:k]
Turn #23Raw score: 1
132 in568 out128 cached700 total11.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 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]]:
if k <= 0:
return []
words = re.findall(r"[A-Za-z']+", text.lower())
counts = Counter(words)
return sorted(counts.items(), key=lambda item: (-item[1], item[0]))[:k]
Turn #24Raw score: 1
132 in1,118 out128 cached1,250 total18.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 Counter
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
if k <= 0:
return []
words = [word.lower() for word in re.findall(r"[A-Za-z']+", text)]
counts = Counter(words)
ordered = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return ordered[:k]
Turn #25Raw score: 1
168 in712 out880 total14.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 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: dict = {}
def rec(value, prefix: str) -> None:
if isinstance(value, dict):
if not value:
if prefix:
result[prefix] = {}
return
for k, v in value.items():
rec(v, f"{prefix}{sep}{k}" if prefix else str(k))
elif isinstance(value, list):
if not value:
if prefix:
result[prefix] = []
return
for i, v in enumerate(value):
rec(v, f"{prefix}{sep}{i}" if prefix else str(i))
else:
result[prefix] = value
for k, v in obj.items():
rec(v, str(k))
return result
Turn #26Raw score: 1
168 in4,478 out4,646 total51.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 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 walk(parts, value):
if isinstance(value, dict):
for key, item in value.items():
path = parts + [str(key)]
if isinstance(item, dict):
if item:
walk(path, item)
else:
result[sep.join(path)] = {}
elif isinstance(item, list):
if item:
walk(path, item)
else:
result[sep.join(path)] = []
else:
result[sep.join(path)] = item
elif isinstance(value, list):
for index, item in enumerate(value):
path = parts + [str(index)]
if isinstance(item, dict):
if item:
walk(path, item)
else:
result[sep.join(path)] = {}
elif isinstance(item, list):
if item:
walk(path, item)
else:
result[sep.join(path)] = []
else:
result[sep.join(path)] = item
walk([], obj)
return result
Turn #27Raw score: 1
168 in1,156 out128 cached1,324 total14.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 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 walk(value, path):
if isinstance(value, dict):
if not value:
result[path] = value
else:
for key, nested in value.items():
new_path = f"{path}{sep}{key}" if path else str(key)
walk(nested, new_path)
elif isinstance(value, list):
if not value:
result[path] = value
else:
for index, nested in enumerate(value):
new_path = f"{path}{sep}{index}" if path else str(index)
walk(nested, new_path)
else:
result[path] = value
for key, value in obj.items():
walk(value, str(key))
return result
Turn #28Raw score: 1
138 in5,581 out5,719 total62.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
from collections import OrderedDict
def lru(maxsize: int):
def decorator(func):
if maxsize <= 0:
def wrapper(*args, **kwargs):
return func(*args, **kwargs)
wrapper.__name__ = func.__name__
return wrapper
cache = OrderedDict()
def wrapper(*args, **kwargs):
key = (args, tuple(sorted(kwargs.items())))
if key in cache:
value = cache.pop(key)
cache[key] = value
return value
value = func(*args, **kwargs)
cache[key] = value
if len(cache) > maxsize:
cache.popitem(last=False)
return value
wrapper.__name__ = func.__name__
return wrapper
return decorator
Turn #29Raw score: 1
138 in4,670 out128 cached4,808 total51.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 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):
cache = OrderedDict()
def wrapper(*args, **kwargs):
key = (args, frozenset(kwargs.items()))
if key in cache:
cache.move_to_end(key)
return cache[key]
result = func(*args, **kwargs)
if maxsize > 0:
cache[key] = result
if len(cache) > maxsize:
cache.popitem(last=False)
return result
wrapper.__name__ = func.__name__
wrapper.__doc__ = func.__doc__
wrapper.__module__ = func.__module__
wrapper.__qualname__ = func.__qualname__
wrapper.__dict__.update(func.__dict__)
return wrapper
return decorator
Turn #30Raw score: 1
138 in2,526 out128 cached2,664 total32.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
from collections import OrderedDict
from functools import wraps
def lru(maxsize: int):
def decorator(func):
cache = OrderedDict()
@wraps(func)
def wrapper(*args, **kwargs):
if maxsize <= 0:
return func(*args, **kwargs)
if kwargs:
key = (args, tuple(sorted(kwargs.items())))
else:
key = args
if key in cache:
cache.move_to_end(key)
return cache[key]
result = func(*args, **kwargs)
cache[key] = result
if len(cache) > maxsize:
cache.popitem(last=False)
return result
return wrapper
return decorator