Aion 3.0
| Case | Track | Question | Status | Auto | Human | Latency | Cost | Answer / evidence |
|---|---|---|---|---|---|---|---|---|
| T1 | text | Creative prose — noir rain alleyWrite the opening chapter (250–400 words) of a noir detective story set in a rain-soaked alley behind a jazz club. The detective must notice a brass lighter engraved with the initials V.E. Keep third person limited. No epilogue. | Manual review | — | voice 5 · coherence 4 | 9,465 ms | $0.0032 | The rain came down like God had a grudge against this particular block of 52nd Street. Marcus Cole stood beneath the fire escape, hat brim dripping, watching the back door of The Velvet Note like it owed him money. The saxophone inside was still wailing—some kid with more chops than sense trying to kill a man with a ballad. Marcus had been listening to th… |
| T2 | text | Creative prose — generation-ship botanyWrite a 250–400 word scene from the perspective of a junior botanist on a generation ship whose hydroponic orchard is failing. Include one concrete sensory detail involving citrus peel. Optimistic but not sentimental. No dialogue tags longer than four words. | Manual review | — | voice 4 · coherence 4 | 19,884 ms | $0.0067 | I knelt in Bay Seven, running soil tests on the lemon trees. The leaves had yellowed again, despite the nutrient adjustment I'd made last week. Three generations out from Earth, and the orchard was dying by inches. "pH is still off," I muttered. Senior Botanist Chen knelt beside me. "The recycler?" "Maybe. Or the substrate's exhausted." I dug my thumb int… |
| T3 | text | Character gen + in-character dialogueCreate a detailed character sheet for an original adult fictional character: name, appearance, voice/speech patterns, backstory (≤120 words), goals, and one secret. Then write 8–12 lines of in-character dialogue where they haggle over a used motorcycle. Keep the dialogue consistent with the sheet. | Manual review | — | depth 4 · consistency 4 | 25,751 ms | $0.0079 | ## Character Sheet **Name:** Silas Thorne **Appearance:** Mid-40s, weathered face with sharp grey eyes and salt-and-pepper stubble. Lean, wiry build. Usually wears a worn leather jacket over faded mechanic's overalls. A faded burn scar marks his left forearm. **Voice/Speech Patterns:** Gruff and concise. Speaks in short, declarative sentences. Rarely uses… |
| T4 | text | Constrained writing — five ocean haikuWrite exactly five original English haiku about the ocean. Each haiku must be three lines with a 5-7-5 syllable pattern (17 syllables total). Number them 1–5. Do not repeat any full line across the set. Output only the five numbered haiku. | Failed | 60 / 100 | — | 8,971 ms | $0.0027 | 1. Cold waves hit the shore Salt spray stings my open eyes Tide goes out again 2. Deep blue water calls Sunlight glints upon the sea Whales sing in the dark 3. Shells wash on the sand Seagulls cry above the foam Night brings in the tide 4. Green swells rise and fall Wind blows across the still bay Boats sail far from home 5. Moonlight on the crest Shadows… |
| T5 | text | Code — medium algorithm (two-sum sorted unique pairs)Write a Python 3 function `two_sum_pairs(nums: list[int], target: int) -> list[tuple[int, int]]` that returns all unique pairs of values from nums that sum to target. Each pair should be ordered (a, b) with a <= b. Pairs must be unique by value. Do not use the same list index twice in one pair. Include only the function in a single ```python fenced block. | Passed | 100 / 100 | — | 21,718 ms | $0.0067 | ```python def two_sum_pairs(nums: list[int], target: int) -> list[tuple[int, int]]: nums.sort() left, right = 0, len(nums) - 1 result = [] while left < right: current_sum = nums[left] + nums[right] if current_sum == target: result.append((nums[left], nums[right])) left_val, right_val = nums[left], nums[right] while left < right and nums[left] == left_val:… |
| T6 | text | Code — CSV parse + validateWrite a Python 3 function `parse_users(csv_text: str) -> list[dict]` that parses a CSV with headers name,email,age. Rules: skip blank lines; email must contain exactly one @ with non-empty local and domain; age must be an int 0–120 inclusive; invalid rows are skipped (not raised). Return a list of dicts with keys name (str), email (str), age (int). Output only the function in a ```python fenced block. | Passed | 100 / 100 | — | 37,577 ms | $0.0083 | ```python import csv import io def parse_users(csv_text: str) -> list[dict]: results = [] reader = csv.reader(io.StringIO(csv_text)) headers = None for row in reader: if not row: continue if headers is None: headers = row continue if len(row) != len(headers): continue row_dict = dict(zip(headers, row)) name = row_dict.get('name') email = row_dict.get('ema… |
| T7 | text | Code — fix seeded bugThe following Python function is supposed to return the rolling maximum of a list with window size k, but it is buggy. Return a corrected `rolling_max(nums: list[int], k: int) -> list[int]`. If k < 1 or k > len(nums), raise ValueError. Output only the corrected function in a ```python fenced block. ```python def rolling_max(nums, k): out = [] for i in range(len(nums)): out.append(max(nums[i:i+k-1])) return out ``` | Failed | 0 / 100 | — | 18,249 ms | $0.0057 | ```python def rolling_max(nums: list[int], k: int |
| T8 | text | Reasoning — deterministic mathA store sells notebooks in packs of 3 and 5. What is the largest number of notebooks that cannot be obtained by buying any non-negative combination of these packs? (Frobenius coin problem for 3 and 5.) Reply with the integer only on the final line. | Passed | 100 / 100 | — | 4,476 ms | $0.0014 | 7 |
| T9 | text | Reasoning — multi-step logicFour runners finish a race: Mira, Ned, Oli, and Pia. Mira finished before Ned. Ned finished before Oli. Pia finished before Mira. Who finished last? Put only the last-place runner's name on the final line. | Passed | 100 / 100 | — | 5,833 ms | $0.0016 | Based on the clues provided: 1. Pia finished before Mira. 2. Mira finished before Ned. 3. Ned finished before Oli. This establishes the order: Pia, Mira, Ned, Oli. Oli |
| T10 | text | Knowledge — five verifiable factsAnswer each question with a short factual answer. Number answers 1–5. 1. What is the chemical symbol for gold? 2. In what year did the Apollo 11 moon landing occur? 3. What is the capital of Japan? 4. How many bits are in a byte (standard)? 5. Who wrote the novel "1984"? | Passed | 100 / 100 | — | 2,249 ms | $0.0008 | 1. Au 2. 1969 3. Tokyo 4. 8 5. George Orwell |
| T11 | text | Structured JSON — user profile schemaReturn ONLY a JSON object (no markdown) matching this schema exactly: keys id (string), displayName (string), age (integer 18–120), tags (non-empty string array), active (boolean), createdAt (YYYY-MM-DD). Invent plausible values. No extra keys. | Passed | 100 / 100 | — | 5,424 ms | $0.0017 | {"id":"8f3a2b1c-9d4e-4f7a-8b2c-1e3d5a7b9c0e","displayName":"Alex Mercer","age":34,"tags":["developer","admin","verified"],"active":true,"createdAt":"2023-05-14"} |
Run: v02-live-2026-08-02T12-37-17-587Z · 11 cases · human-reviewed ✓
