Run Detail
completedqwen3-14b30 answersRecorded for these videos
Provider
openrouter
Challenge Version
v1.0
Turns
30
Duration
461.8s
Total Tokens
84,729
Input Tokens
3,924
Output Tokens
80,805
Reasoning Tokens
76,300
Reasoning Effort
default
Est. Cost
$0.0199
Started
11/4/2026, 10:46:56 PM
OR Provider
DeepInfra
Finish Reason
stop
Generation ID
gen-1793832731-rb0QkZASmhPH1VHKQTCS
Turns (30)
Turn #1Raw score: 1
84 in64 out1 reasoning148 total2.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 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 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 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 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 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 total3.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 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 total3.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 total3.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 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 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 in88 out1 reasoning203 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 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 #9Raw score: 1
115 in88 out1 reasoning203 total3.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 = []
chunk = []
for item in items:
chunk.append(item)
if len(chunk) == n:
result.append(chunk)
chunk = []
if chunk:
result.append(chunk)
return result
Turn #10Raw score: 1
153 in4,028 out3,790 reasoning4,181 total127.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, 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,595 out5,181 reasoning5,748 total204.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 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:
decimal_value = Decimal(value)
rounded = decimal_value.quantize(Decimal('1') / (Decimal('10') ** digits), rounding=ROUND_HALF_UP)
return str(rounded)
Turn #12Raw score: 1
153 in6,865 out6,412 reasoning7,018 total223.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:
d = Decimal(value)
quantize_arg = Decimal(10) ** (-digits)
rounded = d.quantize(quantize_arg, rounding=ROUND_HALF_UP)
return str(rounded)
Turn #13Raw score: 1
148 in101 out1 reasoning249 total3.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 shlex
def parse_kv(line: str) -> dict[str, str]:
if not line.strip():
return {}
parts = shlex.split(line)
result = {}
for part in parts:
if '=' in part:
key, val = part.split('=', 1)
if val.startswith('"') and val.endswith('"'):
val = val[1:-1]
result[key] = val
return result
Turn #14Raw score: 0
148 in103 out1 reasoning251 total3.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 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.split(r'\s+', line)
for pair in pairs:
if '=' in pair:
key, val = pair.split('=', 1)
if val.startswith('"') and val.endswith('"'):
val = val[1:-1]
result[key] = val
return result
Turn #15Raw score: 0
148 in103 out1 reasoning251 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 = {}
parts = re.split(r'\s+', line.strip())
for part in parts:
if not part:
continue
if '=' in part:
key, val = part.split('=', 1)
if val.startswith('"') and val.endswith('"'):
val = val[1:-1]
result[key] = val
return result
Turn #16Raw score: 1
134 in1,713 out1,529 reasoning1,847 total55.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 []
sorted_intervals = sorted(intervals, key=lambda x: x[0])
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 #17Raw score: 1
134 in121 out1 reasoning255 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 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 = [sorted_intervals[0]]
for current in sorted_intervals[1:]:
last = merged[-1]
if current[0] <= last[1]:
merged[-1] = (last[0], max(last[1], current[1]))
else:
merged.append(current)
return merged
Turn #18Raw score: 1
134 in1,922 out1,791 reasoning2,056 total53.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 []
sorted_intervals = sorted(intervals, key=lambda x: x[0])
merged = []
for interval in sorted_intervals:
if not merged:
merged.append(interval)
else:
last_start, last_end = merged[-1]
current_start, current_end = interval
if current_start <= last_end:
merged[-1] = (last_start, max(last_end, current_end))
else:
merged.append(interval)
return merged
Turn #19Raw score: 1
110 in5,098 out3,535 reasoning5,208 total147.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 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:
total_months = d.year * 12 + d.month + months
new_year = total_months // 12
new_month = total_months % 12
if new_month == 0:
new_month = 12
new_year -= 1
if new_month == 12:
next_month = 1
next_year = new_year + 1
else:
next_month = new_month + 1
next_year = new_year
last_day = (datetime.date(next_year, next_month, 1) - datetime.timedelta(days=1)).day
new_day = min(d.day, last_day)
return datetime.date(new_year, new_month, new_day)
Turn #20Raw score: 1
110 in5,184 out3,712 reasoning5,294 total147.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 datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
original_year = d.year
original_month = d.month
original_day = d.day
total_months = original_year * 12 + original_month + months
new_year = total_months // 12
new_month = total_months % 12
if new_month == 0:
new_month = 12
new_year -= 1
try:
new_date = datetime.date(new_year, new_month, original_day)
except ValueError:
if new_month == 12:
next_month = 1
next_year = new_year + 1
else:
next_month = new_month + 1
next_year = new_year
last_day = datetime.date(next_year, next_month, 1) - datetime.timedelta(days=1)
new_date = datetime.date(new_year, new_month, last_day.day)
return new_date
Turn #21Raw score: 1
110 in3,977 out2,846 reasoning4,087 total76.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 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:
total_months = d.year * 12 + d.month + months
new_year = total_months // 12
new_month = total_months % 12
if new_month == 0:
new_month = 12
new_year -= 1
day = d.day
try:
new_date = datetime.date(new_year, new_month, day)
except ValueError:
if new_month == 12:
next_month = 1
next_year = new_year + 1
else:
next_month = new_month + 1
next_year = new_year
last_day = datetime.date(next_year, next_month, 1) - datetime.timedelta(days=1)
new_date = datetime.date(new_year, new_month, last_day.day)
return new_date
Turn #22Raw score: 1
134 in1,401 out1,368 reasoning1,535 total40.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 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_lower = [w.lower() for w in words]
counts = Counter(words_lower)
sorted_counts = sorted(counts.items(), key=lambda x: (-x[1], x[0]))
return sorted_counts[:k]
Turn #23Raw score: 1
134 in3,710 out3,816 reasoning3,844 total48.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 = [word.lower() for word in words]
counts = Counter(words)
sorted_words = sorted(counts.items(), key=lambda x: (-x[1], x[0]))
return sorted_words[:k]
Turn #24Raw score: 1
134 in2,511 out2,574 reasoning2,645 total32.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 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 = [word.lower() for word in words]
counts = Counter(words)
sorted_words = sorted(counts.items(), key=lambda x: (-x[1], x[0]))
return sorted_words[:k]
Turn #25Raw score: 1
170 in7,884 out7,837 reasoning8,054 total106.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 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(prefix, value):
if isinstance(value, dict):
if not value:
result[prefix] = value
return
for key, val in value.items():
new_prefix = f"{prefix}{sep}{key}" if prefix else key
_flatten(new_prefix, val)
elif isinstance(value, list):
if not value:
result[prefix] = value
return
for i, item in enumerate(value):
new_prefix = f"{prefix}{sep}{i}" if prefix else str(i)
_flatten(new_prefix, item)
else:
result[prefix] = value
for key, value in obj.items():
_flatten(key, value)
return result
Turn #26Raw score: 0
170 in8,339 out8,705 reasoning8,509 total112.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:
def _flatten(current_path, obj):
result = {}
if isinstance(obj, dict):
if not obj:
key_str = sep.join(current_path)
result[key_str] = obj
else:
for key, value in obj.items():
new_path = current_path + [key]
if isinstance(value, (dict, list)):
sub_result = _flatten(new_path, value)
result.update(sub_result)
else:
key_str = sep.join(new_path)
result[key_str] = value
elif isinstance(obj, list):
if not obj:
key_str = sep.join(current_path)
result[key_str] = obj
else:
for index, item in enumerate(obj):
new_path = current_path + [str(index)]
if isinstance(item, (dict, list)):
sub_result = _flatten(new_path, item)
result.update(sub_result)
else:
key_str = sep.join(new_path)
result[key_str] = item
return result
return _flatten([], obj)
Turn #27Raw score: 1
170 in11,047 out11,571 reasoning11,217 total146.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": {}}.
assistant
def flatten(obj: dict, sep: str = ".") -> dict:
result = {}
def _process(current_obj, current_prefix):
if isinstance(current_obj, dict):
if not current_obj:
if current_prefix:
result[current_prefix] = current_obj
else:
for key, value in current_obj.items():
new_prefix = current_prefix + sep + key if current_prefix else key
if isinstance(value, (dict, list)):
_process(value, new_prefix)
else:
result[new_prefix] = value
elif isinstance(current_obj, list):
if not current_obj:
if current_prefix:
result[current_prefix] = current_obj
else:
for i, item in enumerate(current_obj):
new_prefix = current_prefix + sep + str(i) if current_prefix else str(i)
if isinstance(item, (dict, list)):
_process(item, new_prefix)
else:
result[new_prefix] = item
_process(obj, "")
return result
Turn #28Raw score: 1
140 in3,377 out3,747 reasoning3,517 total46.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 import OrderedDict
def lru(maxsize: int):
def decorator(func):
cache = OrderedDict()
def wrapper(*args):
key = args
if key in cache:
cache.move_to_end(key)
return cache[key]
result = func(*args)
cache[key] = result
if len(cache) > maxsize:
cache.popitem(last=False)
return result
wrapper.__name__ = func.__name__
return wrapper
return decorator
Turn #29Raw score: 1
140 in3,714 out4,234 reasoning3,854 total49.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 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
import collections
def lru(maxsize: int):
def decorator(func):
cache = collections.OrderedDict()
def wrapper(*args):
key = args
if key in cache:
cache.move_to_end(key)
return cache[key]
else:
value = func(*args)
cache[key] = value
if len(cache) > maxsize:
cache.popitem(last=False)
return value
wrapper.__name__ = func.__name__
return wrapper
return decorator
Turn #30Raw score: 1
140 in3,237 out3,639 reasoning3,377 total41.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 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
if key in cache:
cache.move_to_end(key)
return cache[key]
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