Run Detail
completedglm-5.3-flash30 answersRecorded for these videos
Provider
openrouter
Challenge Version
v1.0
Turns
30
Duration
304.8s
Total Tokens
173,562
Input Tokens
3,978
Output Tokens
169,584
Reasoning Tokens
166,130
Reasoning Effort
default
Cached Input Tokens
704
Est. Cost
$0.0853
Started
11/10/2026, 6:59:46 PM
OR Provider
Together
Finish Reason
stop
Generation ID
gen-1794337427-feCxClDsvR8PTemnMqoH
Turns (30)
Turn #1Raw score: 1
86 in1,301 out1,239 reasoning1,387 total8.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 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 True if `year` is a leap year in the Gregorian calendar."""
return year % 4 == 0 and (year % 100 != 0 or year % 400 == 0)
Turn #2Raw score: 1
86 in1,976 out1,916 reasoning2,062 total10.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 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 whether `year` is a leap year in the Gregorian calendar."""
return year % 4 == 0 and (year % 100 != 0 or year % 400 == 0)
Turn #3Raw score: 1
86 in738 out694 reasoning824 total17.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 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
122 in547 out448 reasoning669 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 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 ""
parts = []
prev = s[0]
count = 1
for ch in s[1:]:
if ch == prev:
count += 1
else:
parts.append(f"{prev}{count}")
prev = ch
count = 1
parts.append(f"{prev}{count}")
return "".join(parts)
Turn #5Raw score: 1
122 in563 out518 reasoning685 total4.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 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 #6Raw score: 1
122 in363 out317 reasoning485 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 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(sum(1 for _ in group)) for char, group in groupby(s))
Turn #7Raw score: 1
117 in1,878 out1,793 reasoning1,995 total21.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 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 = []
chunk = []
for item in items:
chunk.append(item)
if len(chunk) == n:
result.append(chunk)
chunk = []
if chunk:
result.append(chunk)
return result
Turn #8Raw score: 1
117 in910 out850 reasoning1,027 total5.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 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 batched
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
return [list(batch) for batch in batched(items, n)]
Turn #9Raw score: 1
117 in591 out533 reasoning708 total3.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 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 batched
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
return [list(batch) for batch in batched(items, n)]
Turn #10Raw score: 0
153 in32,000 out32,000 reasoning32,153 total222.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 #11Raw score: 0
153 in32,000 out32,000 reasoning64 cached32,153 total225.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 #12Raw score: 0
153 in32,000 out32,000 reasoning64 cached32,153 total203.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 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
150 in2,443 out2,190 reasoning2,593 total15.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 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] = {}
s = line.strip()
if not s:
return result
i = 0
n = len(s)
while i < n:
while i < n and s[i] == ' ':
i += 1
if i >= n:
break
start = i
while i < n and s[i] not in ' =':
i += 1
key = s[start:i]
value = ''
if i < n and s[i] == '=':
i += 1
if i < n and s[i] == '"':
i += 1
start = i
while i < n and s[i] != '"':
i += 1
value = s[start:i]
if i < n:
i += 1
else:
start = i
while i < n and s[i] != ' ':
i += 1
value = s[start:i]
if key:
result[key] = value
return result
Turn #14Raw score: 1
150 in3,286 out3,038 reasoning64 cached3,436 total20.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] == ' ':
i += 1
if i >= n:
break
start = i
while i < n and line[i] != '=' and line[i] != ' ':
i += 1
key = line[start:i]
if i < n and line[i] == '=':
i += 1
if i < n and line[i] == '"':
i += 1
vstart = i
while i < n and line[i] != '"':
i += 1
if i < n:
result[key] = line[vstart:i]
i += 1
else:
result[key] = line[vstart:]
else:
vstart = i
while i < n and line[i] != ' ':
i += 1
result[key] = line[vstart:i]
return result
Turn #15Raw score: 1
150 in11,926 out11,663 reasoning64 cached12,076 total74.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 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] = {}
s = line.strip()
i = 0
n = len(s)
while i < n:
while i < n and s[i] == ' ':
i += 1
if i >= n:
break
start = i
while i < n and s[i] != '=' and s[i] != ' ':
i += 1
key = s[start:i]
has_eq = i < n and s[i] == '='
value = ''
if has_eq:
i += 1
if i < n and s[i] == '"':
i += 1
vstart = i
while i < n and s[i] != '"':
i += 1
value = s[vstart:i]
if i < n:
i += 1
else:
vstart = i
while i < n and s[i] != ' ':
i += 1
value = s[vstart:i]
if has_eq and key:
result[key] = value
return result
Turn #16Raw score: 1
136 in935 out798 reasoning1,071 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 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)
merged: list[tuple[int, int]] = []
current_start, current_end = sorted_intervals[0]
for start, end in sorted_intervals[1:]:
if start <= current_end:
if end > current_end:
current_end = end
else:
merged.append((current_start, current_end))
current_start, current_end = start, end
merged.append((current_start, current_end))
return merged
Turn #17Raw score: 1
136 in1,187 out1,064 reasoning64 cached1,323 total7.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 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)
merged: list[tuple[int, int]] = [sorted_intervals[0]]
for start, end in sorted_intervals[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
136 in1,686 out1,567 reasoning64 cached1,822 total10.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)
merged: list[tuple[int, int]] = [sorted_intervals[0]]
for start, end in sorted_intervals[1:]:
last_start, last_end = merged[-1]
if start <= last_end:
merged[-1] = (last_start, max(last_end, end))
else:
merged.append((start, end))
return merged
Turn #19Raw score: 1
112 in928 out831 reasoning1,040 total5.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:
month_index = d.month - 1 + months
year = d.year + month_index // 12
month = month_index % 12 + 1
day = min(d.day, calendar.monthrange(year, month)[1])
return d.replace(year=year, month=month, day=day)
Turn #20Raw score: 1
112 in1,712 out1,615 reasoning1,824 total10.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 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
112 in662 out559 reasoning774 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 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 d.replace(year=year, month=month, day=min(d.day, last_day))
Turn #22Raw score: 1
136 in2,045 out1,957 reasoning2,181 total12.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 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 []
counts = Counter(word.lower() for word in re.findall(r"[A-Za-z']+", text))
return sorted(counts.items(), key=lambda item: (-item[1], item[0]))[:k]
Turn #23Raw score: 1
136 in2,112 out2,023 reasoning64 cached2,248 total12.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 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 []
counts = Counter(word.lower() for word in re.findall(r"[A-Za-z']+", text))
return sorted(counts.items(), key=lambda item: (-item[1], item[0]))[:k]
Turn #24Raw score: 1
136 in1,348 out1,260 reasoning64 cached1,484 total9.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 []
counts = Counter(word.lower() for word in re.findall(r"[A-Za-z']+", text))
return sorted(counts.items(), key=lambda item: (-item[1], item[0]))[:k]
Turn #25Raw score: 1
172 in3,765 out3,567 reasoning3,937 total20.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 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 _flatten(prefix: str | None, value) -> None:
if isinstance(value, dict):
if not value:
if prefix is not None:
result[prefix] = {}
return
for k, v in value.items():
new_key = f"{prefix}{sep}{k}" if prefix is not None else str(k)
_flatten(new_key, v)
elif isinstance(value, list):
if not value:
if prefix is not None:
result[prefix] = []
return
for i, v in enumerate(value):
new_key = f"{prefix}{sep}{i}" if prefix is not None else str(i)
_flatten(new_key, v)
else:
result[prefix] = value
_flatten(None, obj)
return result
Turn #26Raw score: 1
172 in5,267 out5,097 reasoning64 cached5,439 total32.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: dict = {}
def _flatten(value, prefix: str = "") -> None:
if isinstance(value, dict):
if not value:
if prefix:
result[prefix] = {}
return
for k, v in value.items():
_flatten(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):
_flatten(v, f"{prefix}{sep}{i}" if prefix else str(i))
else:
result[prefix] = value
_flatten(obj)
return result
Turn #27Raw score: 1
172 in4,131 out3,928 reasoning64 cached4,303 total25.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 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 _walk(value, prefix: str) -> None:
if isinstance(value, dict):
if not value:
result[prefix] = {}
else:
for k, v in value.items():
_walk(v, f"{prefix}{sep}{k}" if prefix else str(k))
elif isinstance(value, list):
if not value:
result[prefix] = []
else:
for i, v in enumerate(value):
_walk(v, f"{prefix}{sep}{i}" if prefix else str(i))
else:
result[prefix] = value
if isinstance(obj, dict):
for k, v in obj.items():
_walk(v, str(k))
elif isinstance(obj, list):
for i, v in enumerate(obj):
_walk(v, str(i))
return result
Turn #28Raw score: 1
142 in7,656 out7,439 reasoning7,798 total48.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 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):
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)
if maxsize > 0:
cache[key] = result
if len(cache) > maxsize:
cache.popitem(last=False)
return result
def cache_clear():
cache.clear()
wrapper.__name__ = func.__name__
wrapper.__qualname__ = getattr(func, "__qualname__", func.__name__)
wrapper.__doc__ = func.__doc__
wrapper.__module__ = func.__module__
wrapper.__dict__.update(func.__dict__)
wrapper.__wrapped__ = func
wrapper.cache_clear = cache_clear
return wrapper
return decorator
Turn #29Raw score: 1
142 in10,777 out10,501 reasoning10,919 total64.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 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.abc import Callable
def lru[T](maxsize: int) -> Callable[[Callable[..., T]], Callable[..., T]]:
"""Decorator factory: cache a function's results keyed by its call
arguments, evicting the least recently used entry once maxsize is hit."""
def decorator(func: Callable[..., T]) -> Callable[..., T]:
cache: dict[tuple, T] = {}
def wrapper(*args: object, **kwargs: object) -> T:
if maxsize <= 0:
return func(*args, **kwargs)
key = args + tuple(sorted(kwargs.items()))
try:
result = cache.pop(key)
except KeyError:
result = func(*args, **kwargs)
cache[key] = result
if len(cache) > maxsize:
del cache[next(iter(cache))]
return result
wrapper.__module__ = func.__module__
wrapper.__name__ = func.__name__
wrapper.__qualname__ = func.__qualname__
wrapper.__doc__ = func.__doc__
wrapper.__annotations__ = func.__annotations__
wrapper.__type_params__ = func.__type_params__
wrapper.__dict__.update(func.__dict__)
wrapper.__wrapped__ = func
return wrapper
return decorator
Turn #30Raw score: 1
142 in2,851 out2,725 reasoning64 cached2,993 total17.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 functools import wraps
def lru(maxsize: int):
def decorator(func):
cache = {}
@wraps(func)
def wrapper(*args, **kwargs):
key = args
if key in cache:
result = cache.pop(key)
cache[key] = result
return result
result = func(*args, **kwargs)
if maxsize > 0:
if len(cache) >= maxsize:
del cache[next(iter(cache))]
cache[key] = result
return result
return wrapper
return decorator