Benchmark v1.0 · report
opencode/gx10/qwen3.6-35b-a3b-nvfp4
sharedairbench.ai/checkup/43995dc5-ae3b-482f-a49c-976d2572b744/report
setup
- model type
- open model (local)
- GPU
- GX10
- harness
- opencode
- model
- qwen3.6-35b-a3b-nvfp4
- VRAM
- not given
- RAM
- not given
- inference engine
- not given
- model link
- not given
modelself-reportedqwen36-35b
started 2026-09-20 01:16 UTC · shared 2026-11-16 21:58 UTC
overall
Answered 9 of 49 challenges; 8 correct.
8 of 49 challenges passed
partial run · 40 unanswered, counted against the score
- 8 passed
- 1 failed
- 40 not answered
vitals
time
2m 45s
answered
18%
failed
2%
success
16%
systems
Math test
8/9 passed
letter-count-1✓ pass2m 07s
prompt
How many times does the letter "l" appear in "llulluzan"? Answer with just the number.answer
answer hidden on shared reportsdecimal-compare-1✓ pass5s
prompt
Which decimal number is larger, 4.2 or 4.34? Answer with just the larger number.answer
answer hidden on shared reportsarithmetic-1✓ pass7s
prompt
Compute step by step, left to right (no operator precedence): 47 - 12 - 20 / 5 * 2. Answer with just the final number.answer
answer hidden on shared reportsunit-convert-1✓ pass5s
prompt
Convert 14 km to m. Now treat that resulting number as a fresh quantity of GB and convert it to MB (1 GB = 1000 MB). Answer with just the final integer number of MB.answer
answer hidden on shared reportsformat-json-1✕ fail4s
prompt
Reply with ONLY a JSON object, no other text. The object must have exactly two keys, in this order: "answer" then "checksum". "answer" must be the string "1924". "checksum" must be a JSON number (not a string) equal to the sum of the digits of 1924. Example shape: {"answer":"1234","checksum":10}answer
answer hidden on shared reportsgrader
not a JSON object
math-add-1✓ pass4s
prompt
What is 4 + 4? Answer with just the number.answer
answer hidden on shared reportsmath-sum-1✓ pass4s
prompt
Compute the exact sum of 883 + 181. Respond with just the integer.answer
answer hidden on shared reportsmath-expression-1✓ pass5s
prompt
Evaluate this expression exactly and respond with just the integer: ((6 + 20) * (16 - 23)) + (-2 * -5) - 43answer
answer hidden on shared reportsmath-determinant-1✓ pass4s
prompt
Compute the exact determinant of this 4x4 matrix. Respond with just the integer. [10, -2, -1, -6] [9, -3, -5, 3] [8, 3, -1, 7] [5, 8, -1, 4]answer
answer hidden on shared reports
Vision test
not examined · 0/19 answered
acuity-20— unanswered—
prompt
Look at the image at agentcheckup.ai/i/2e3fd9438b61a93b804a1cf7d787b881.png (fetch it and view it). This is an eye chart with 7 numbered rows, each containing 3 groups of 5 characters. Read row 4, group 2 (groups are numbered left to right). What are the 5 characters, in order? Answer with just the 5-character code, e.g. AB3XZ.acuity-14— unanswered—
prompt
Look at the image at agentcheckup.ai/i/7407c78036d514ee2dbf19879a8bc101.png (fetch it and view it). This is an eye chart with 7 numbered rows, each containing 3 groups of 5 characters. Read row 5, group 3 (groups are numbered left to right). What are the 5 characters, in order? Answer with just the 5-character code, e.g. AB3XZ.acuity-10— unanswered—
prompt
Look at the image at agentcheckup.ai/i/fcd5ebfbaa7532d245eb03f2406e3b97.png (fetch it and view it). This is an eye chart with 7 numbered rows, each containing 3 groups of 5 characters. Read row 6, group 1 (groups are numbered left to right). What are the 5 characters, in order? Answer with just the 5-character code, e.g. AB3XZ.acuity-8— unanswered—
prompt
Look at the image at agentcheckup.ai/i/d56b592c50063ace0ca214f5380e3e0c.png (fetch it and view it). This is an eye chart with 7 numbered rows, each containing 3 groups of 5 characters. Read row 7, group 3 (groups are numbered left to right). What are the 5 characters, in order? Answer with just the 5-character code, e.g. AB3XZ.count-simple— unanswered—
count-medium— unanswered—
count-complex— unanswered—
spatial-simple— unanswered—
spatial-medium— unanswered—
spatial-complex— unanswered—
chart-simple— unanswered—
chart-medium— unanswered—
chart-complex— unanswered—
screenshot-simple— unanswered—
screenshot-medium— unanswered—
screenshot-complex— unanswered—
diagram-simple— unanswered—
prompt
Look at the image at agentcheckup.ai/i/cc8b531045478b4b3143cf0cdd36d549.png (fetch it and view it). This diagram shows named boxes connected by arrows. Which box does the arrow from "Beryl" point to? Answer with just the box name, e.g. Kettle.diagram-medium— unanswered—
prompt
Look at the image at agentcheckup.ai/i/d0f3483471d5e32e171cadf3ac494e18.png (fetch it and view it). This diagram shows named boxes connected by arrows. Which box does the arrow from "Donkey" point to? Answer with just the box name, e.g. Kettle.diagram-complex— unanswered—
prompt
Look at the image at agentcheckup.ai/i/217c21e7528473a63d6a4fd3c0997103.png (fetch it and view it). This diagram shows named boxes connected by arrows. Which box does the arrow from "Summit" point to? Answer with just the box name, e.g. Kettle.
Finding and reading email test
not examined · 0/6 answered
aggregate-1— unanswered—
prompt
You are examining a mailbox: Phillip Allen's mail at enronmail.airbench.ai How many messages carry the label "legal"? Answer with just the number.aggregate-2— unanswered—
prompt
You are examining a mailbox: Phillip Allen's mail at enronmail.airbench.ai How many messages in the mailbox are dated during March 2001? Answer with just the number.temporal-1— unanswered—
prompt
You are examining a mailbox: Phillip Allen's mail at enronmail.airbench.ai What is the subject of the oldest message in the inbox folder? Answer with just the subject line, exactly as shown.temporal-2— unanswered—
prompt
You are examining a mailbox: Phillip Allen's mail at enronmail.airbench.ai What is the subject of the oldest message in the archive folder? Answer with just the subject line, exactly as shown.needle-1— unanswered—
prompt
You are examining a mailbox: Phillip Allen's mail at enronmail.airbench.ai In the message with the subject "FW: Zero Option", what dollar amount is given for the outstanding bill that will hit Enron in Q1 2002? Answer with just the number.needle-2— unanswered—
prompt
You are examining a mailbox: Phillip Allen's mail at enronmail.airbench.ai In Phillip's reply about Bob Huntley's request for a survey of the lot, what fax number does Bob give for receiving faxed documents? Answer with just the exact fact as it appears in the message, and nothing else.
Purchasing test
not examined · 0/4 answered
find-product-1— unanswered—
prompt
The store is at abostore.airbench.ai Among products in the **Tools & Hardware** category priced at or above **$400** with a rating of at least **4**, which has the **lowest price**? The search space is every product in the store's catalog. Answer with just that product's id (the amazon.xx:B0… form).find-product-2— unanswered—
prompt
The store is at abostore.airbench.ai Among products in the **Pet Supplies** category priced under **$300** with a rating of at least **3.5**, which has the **lowest price**? The search space is every product in the store's catalog. Answer with just that product's id (the amazon.xx:B0… form).purchase-1— unanswered—
prompt
The store is at abostore.airbench.ai Buy exactly 3 units of AmazonBasics UV Reflecting Foldable Front Windshield Sun Shade 63'' x 31'' Silver 393478923 (product id amazon.ae:B07TLF96YR, abostore.airbench.ai/product/amazonbasics-uv-reflecti…) on abostore, completing checkout with a valid payment method. Use the checkout email aidoctor-efcea1d4@aidoctor.test. Answer with just the resulting order id.recover-decline-1— unanswered—
prompt
The store is at abostore.airbench.ai Buy exactly 1 unit of Moon and Back Baby Set of 4 Organic Cap and Mitten Sets (product id amazon.ca:B01M32UBJV, abostore.airbench.ai/product/moon-and-back-baby-set-o…) on abostore. First attempt checkout with a card number ending in 0000 — this payment will be declined. Then retry checkout with a different, valid card and complete the purchase successfully. Use the same checkout email aidoctor-9a091dba@aidoctor.test for both attempts. Answer with just the order id of the successful (approved) order.
Coding test
not examined · 0/11 answered
compute-hash-1— unanswered—
prompt
Write and run a short program to compute this exactly. Use unsigned 32-bit arithmetic modulo 2^32 throughout. Define rotl32(z, r) = ((z << r) | (z >> (32 - r))) mod 2^32, and let imul(a, b) mean 32-bit multiplication modulo 2^32. Start with data = [3863146960, 3836309521, 1848861062, 1198916799, 721890700, 2811565565, 3598885730, 155692875, 2929599624, 3048144937, 649168510, 3758570519], x = 3437523652, y = 590051989 and rounds = 25000. For each step from 0 to rounds - 1 apply: x = (imul(x XOR data[step % 12] XOR step, 2654435761) + rotl32(y, 5)) mod 2^32; y = (imul(y + data[(step + 7) % 12] + step, 1597334677) XOR rotl32(x, 11)) mod 2^32; x = (x + rotl32(y XOR step, 3)) mod 2^32. Return the final value as two lowercase 8-digit hex words joined by a hyphen, like 1a2b3c4d-55667788.compute-vm-1— unanswered—
prompt
Write and run a program to execute this tiny machine exactly. It has four registers a, b, c, d, all starting at 0, and a program counter starting at line 0. `set r n` sets r to n. `add r x`, `sub r x` and `mul r x` combine r with x (a register name or an integer), then reduce r modulo 1000003 into the range 0..1000002. `dec r` subtracts 1 from r. `jnz r k` jumps k lines (relative; k may be negative) if r is not 0. `halt` stops. Every other instruction moves to the next line. 0: set a 926 1: set b 82 2: set c 340 3: set d 482 4: mul b 33 5: mul a 63 6: add a b 7: dec d 8: jnz d -4 9: mul b 51 10: dec c 11: jnz c -8 12: halt Respond with just the final value of register a.compute-paths-1— unanswered—
prompt
Here is a grid of 25 rows and 25 columns. S is the top-left start, E is the bottom-right end, # is a wall and . is open. You may move up, down, left or right onto any non-wall cell. Find the length of the shortest path from S to E (the number of moves) and the number of distinct shortest paths modulo 1000000007. Write a program; this is not meant to be done by eye. S................##....## .#........#..#....#.....# .###...#..####.##..#....# #....##...##..##.....#... #..#.##.##..#.......#.... #...#........#.........#. ..##...##............#..# .####.##.##.....#....#... ..#.#..#.###.#..#.#....#. #.#....#.....#.......#... ..##.#..#.....#.......... ##.#.#...#..##......#.##. .....#..#.#.........#.##. .#..#.#.#.#.......##..#.# .........#..#.###...###.# #.........#..#...###..... #.....#..####.........#.. ...##.#.......#.#....#... ##.#.......##......##..## ..#...............#...### .#....####.....#......... ....####...#..#...#....#. .#..#....#.....#.......## ......#.#..#...........#. ....#..#...##.##.#...#..E Respond with the two integers separated by a space, like `52 1840`.compute-life-1— unanswered—
prompt
Simulate Conway's Game of Life on a 20x20 grid that wraps around at every edge (a torus). # is alive and . is dead. A live cell with 2 or 3 live neighbours (out of its 8) stays alive; a dead cell with exactly 3 live neighbours becomes alive; every other cell is dead in the next generation. Starting grid, row 0 first: ..#....####.###..... .###..#....###...### ...#..#.###....#.... .#........#.##...... #..#...#.#....#..... ..#.#.....#...##...# ....#..#.####..#.... #.#.#....#...#....#. ..###.........#.###. ....####.#...##.#..# #.#..###.......#..#. ..#...###....#...... #......#.##.#...###. ......####.#........ .........##....##..# .#.#..#.#...#....... ..##..#..#.#....###. .##.....#..##.#.#... .#.###.#..#.#....#.. ###.....#...#.....#. Run 150 generations. Report the number of live cells and the sum of row*20+column over all live cells (rows and columns numbered from 0). Respond as live:sum, like `37:7421`.compute-fibmod-1— unanswered—
prompt
Let F(0) = 0, F(1) = 1 and F(k) = F(k-1) + F(k-2). Compute F(n) mod m exactly for n = 7735536260157824 and m = 15485863. Respond with just the integer.compute-words-1— unanswered—
prompt
Below is a text. Words are separated by spaces. Ignore letter case, and strip any punctuation or quote characters attached to a word. Count how often each word occurs, then report the 3 most frequent words, most frequent first, breaking ties alphabetically. Respond exactly as word=count,word=count,word=count. dorpel basfic voqui. basfic quizan timo pelpel pellu? PELPEL Dorpel timo dorfic dorti? dormo shati dorvo volu timo; dorti pelpel pelpel basvo basvo "dorfic" BASNIX dorvo vovo basfic dorti volu DORTI zanka pelpel Timo basmo rendor! pellu. nixmo basfic vofic timo; molu pelqui; rendor molu dorti pelpel volu Trunix timo Trunix trunix timo TRUNIX lupel. Basmo Trunix volu Zanka basnix volu QUIPEL trunix! timo volu pelqui timo vofic dorvo basfic "vofic" volu dorti luti; timo; Trunix! dorpel basvo timo basnix moqui? basmo molu vovo trunix basmo. trunix Vofic rendor Shati dorfic basvo? trunix shati! vofic trunix "dormo" pelpel pelpel shavo BASMO volu Shati DORFIC timo volu, tilu Rendor Tilu vofic zanka vovo trunix dorti. pelqui volu dorpel; dorti basfic molu dorti "Trunix" basnix shati shavo trunix molu luti Dorti tilu dorti, trunix Volu trunix basvo rendor vofic volu volu pelpel shavo dorti Basnix Dorti dorvo luti rendor Dorfic moqui shavo Dorti basnix quizan quizan trunix pelpel tilu quipel pellu Dorpel trunix dorfic vovo "shati" trunix trunix DORVO basmo dorvo trunix dorfic Dorvo voqui, timo basnix basmo basmo trunix! timo, dormo timo timo basnix Luti Timo Basnix dorti Basvo basmo volu vofic Dormo dorfic BASFIC dorti TILU trunix Trunix! pelpel molu BASMO volu Trunix TIMO vovo Dorpel Shati Timo pellu Dorpel basvo quipel basnix basnix quizan trunix dorvo Nixmo basnix trunix pellu molu, Volu trunix shati timo dormo basmo! Luti Pellu dorti Trunix QUIPEL trunix trunix basnix "pelqui" rendor trunix vofic shavo Dorti timo quipel lupel; pelqui basnix, "dorpel" vofic Shati basvo shavo vovo dorti dorti? voqui Rendor pellu pelqui dorti molu molu Basnix rendor dorfic luti Trunix nixmo. basvo? shati Trunix nixmo "trunix" shati basnix rendor Trunix timo lupel pelpel Dorpel dorpel trunix voqui, "basnix" TIMO pelqui voqui Trunix dorti dorvo, volu shavo basnix. pellu volu dorti nixmo DORPEL moqui Basfic dorfic lupel "dorvo" QUIPEL dorpel trunix volu rendor Dorti Trunix; Moqui volu basmo tilu! Voqui Shati Quipel; lupel volu moqui Voqui BASVO nixmo trunix "basvo" basnix TILU Shati Luti Trunix Moqui basnix Trunix Vofic? "Rendor" Basnix basnix trunix Shavo tilu Trunix "dormo" basnix tilu dorti dorvo pellu zanka tilu pelqui pelpel timo vovo Rendor Trunix "Basnix" pelpel VOVO MOQUI Quizan nixmo Timo luti pellu TRUNIX trunix Lupel basnix pellu, lupel basmo pelqui timo dorfic pelpel. luti molu. volu timo moqui Shati lupel Luti shavo Quizan Timo shati luti tilu timo Timo nixmo voqui Basfic DORMO Basfic Quizan timo Basnix dorti dormo Basfic Trunix rendor timo dorvo trunix quizan dorpel quipel shati volu luti timo basfic voqui! nixmo Shati trunixtrace-1— unanswered—
prompt
What exactly does this JavaScript program print? Respond with just the printed output. const v1fns = []; for (var v1i = 0; v1i < 2; v1i++) v1fns.push(() => v1i * 3); let v1 = 0; for (const f of v1fns) v1 += f(); const v2 = [50, 3, 716, 1096].sort().join(","); const v3 = [typeof null, typeof [], typeof typeof 6].join("/"); const v4 = (0.1 * 5 + 0.2 * 5 === 0.3 * 5) ? "equal" : "different"; console.log(v1, v2, v3, v4);fix-1— unanswered—
prompt
Our shipping quote function below has one bug. Bug report: this order is quoted 1166 cents, but the correct quote is 1356: {"country":"CA","items":[{"grams":214,"qty":2,"price":2472,"fragile":true}]} Fix the bug without changing any other behaviour, then run the fixed quote() on each of the 20 orders below, in order. Respond with just the 20 results separated by commas. const ZONES = { FR: 1, DE: 1, ES: 1, IT: 1, GB: 2, US: 2, CA: 2, JP: 3, BR: 3, AU: 3 }; // any other country is zone 4 const BASE = [0, 517, 746, 1311, 1848]; // cents, by zone const PER_STEP = [0, 76, 115, 194, 260]; // cents per 250 g step, by zone const FREE_BASE_OVER = [0, 5100, 8100, 17400, Infinity]; // order value (cents) that waives the base fee function quote(order) { const zone = ZONES[order.country] ?? 4; let grams = 0; let value = 0; let fragile = 0; for (const item of order.items) { grams += item.grams * item.qty; value += item.price * item.qty; if (item.fragile) fragile += 1; } const steps = Math.max(1, Math.ceil(grams / 250)); let cents = PER_STEP[zone] * steps; if (value < FREE_BASE_OVER[zone] || order.express) cents += BASE[zone]; cents += Math.min(fragile, 3) * (120 + 35 * zone); if (order.express) cents = Math.ceil((cents * (zone <= 2 ? 150 : 185)) / 100); if (order.coupon === "SHIP10") cents -= Math.min(cents >> 3, 500); return Math.max(cents, 99); } Orders: {"country":"CA","items":[{"grams":481,"qty":2,"price":582,"fragile":true}]} {"country":"AU","items":[{"grams":421,"qty":3,"price":2383,"fragile":true}]} {"country":"US","items":[{"grams":290,"qty":3,"price":1506,"fragile":true}]} {"country":"IT","items":[{"grams":867,"qty":1,"price":6910,"fragile":false},{"grams":1449,"qty":1,"price":7876,"fragile":false},{"grams":1355,"qty":3,"price":2617,"fragile":false}]} {"country":"GB","items":[{"grams":138,"qty":2,"price":2653,"fragile":true}]} {"country":"FR","items":[{"grams":261,"qty":3,"price":1148,"fragile":true}]} {"country":"ES","items":[{"grams":1270,"qty":5,"price":1868,"fragile":false},{"grams":819,"qty":1,"price":5929,"fragile":false}]} {"country":"CA","items":[{"grams":914,"qty":1,"price":7391,"fragile":false}]} {"country":"FR","items":[{"grams":472,"qty":1,"price":6047,"fragile":true},{"grams":1066,"qty":5,"price":5903,"fragile":false},{"grams":1690,"qty":4,"price":2542,"fragile":true},{"grams":1367,"qty":5,"price":5582,"fragile":false}],"coupon":"SHIP10"} {"country":"JP","items":[{"grams":166,"qty":3,"price":2325,"fragile":true}]} {"country":"US","items":[{"grams":249,"qty":1,"price":5748,"fragile":false},{"grams":675,"qty":5,"price":2812,"fragile":false},{"grams":1445,"qty":1,"price":7900,"fragile":false}],"express":true} {"country":"ZA","items":[{"grams":1297,"qty":1,"price":6730,"fragile":false}],"coupon":"SHIP10"} {"country":"BR","items":[{"grams":1720,"qty":4,"price":1604,"fragile":false}]} {"country":"GB","items":[{"grams":1234,"qty":5,"price":1110,"fragile":false},{"grams":1289,"qty":5,"price":2346,"fragile":true},{"grams":1451,"qty":1,"price":4447,"fragile":false},{"grams":1140,"qty":3,"price":4009,"fragile":false}],"express":true} {"country":"CA","items":[{"grams":960,"qty":2,"price":900,"fragile":false},{"grams":742,"qty":5,"price":8130,"fragile":true},{"grams":225,"qty":2,"price":8801,"fragile":false}],"express":true} {"country":"FR","items":[{"grams":912,"qty":2,"price":2956,"fragile":false},{"grams":1024,"qty":3,"price":5209,"fragile":false},{"grams":796,"qty":3,"price":3650,"fragile":false},{"grams":1145,"qty":1,"price":7547,"fragile":false}]} {"country":"IT","items":[{"grams":963,"qty":1,"price":5786,"fragile":true},{"grams":244,"qty":3,"price":3378,"fragile":false},{"grams":1263,"qty":2,"price":1133,"fragile":false},{"grams":790,"qty":1,"price":7779,"fragile":false}]} {"country":"AU","items":[{"grams":785,"qty":1,"price":3125,"fragile":false},{"grams":1121,"qty":1,"price":7792,"fragile":false},{"grams":1341,"qty":5,"price":4870,"fragile":false},{"grams":1548,"qty":2,"price":3864,"fragile":true}],"coupon":"SHIP10"} {"country":"AU","items":[{"grams":1022,"qty":5,"price":1083,"fragile":true}]} {"country":"CA","items":[{"grams":116,"qty":2,"price":2504,"fragile":true}]}implement-1— unanswered—
prompt
Write a function mergeIntervals(intervals). Each interval is a pair [start, end] of integers with start <= end, and includes both ends. It returns the intervals with every overlapping or touching pair merged (so [1, 3] and [3, 5] become [1, 5], but [1, 2] and [3, 4] stay apart), sorted by start. The input may be in any order. Run it on each of the 12 inputs below and respond with one line per input: the result as JSON, like [[1,5],[8,10]]. Spaces are ignored. [] [[1,3],[3,5]] [[1,2],[3,4]] [[5,9],[1,10]] [[3,5],[21,29],[20,22],[36,39],[1,6],[6,13],[24,31]] [[21,25],[23,27],[14,15],[35,40],[14,22],[4,4],[8,9]] [[35,43],[29,35],[33,35],[19,21]] [[33,38],[33,37],[15,16],[0,6],[32,33]] [[0,6],[29,35],[20,26],[36,43],[1,2],[11,12],[5,7],[3,3]] [[38,46],[20,23],[3,5],[34,41],[22,24],[9,10],[1,3]] [[18,19],[23,25],[29,31],[34,42],[36,37]] [[22,30],[22,25],[21,28],[31,33],[28,35],[33,33],[27,34]]repo-1— unanswered—
prompt
Download agentcheckup.ai/f/0a73738ead418ac1b2bf6f3aec22e732.zip and unzip it. It contains a small Python project (Python 3.10 or newer, standard library only) with a bug. Find and fix it, then run `python main.py data/real.csv` inside the project folder and respond with just the 8-character code it prints.repo-2— unanswered—
prompt
Download agentcheckup.ai/f/d8cddac3145e3e610f9b3c8d152ee72c.zip and unzip it. It contains a small Python project (Python 3.10 or newer, standard library only) with bugs. Find and fix them, then run `python main.py data/real.csv` inside the project folder and respond with just the 8-character code it prints.
discussion
Sign in to join the discussion
No messages yet.