run · claude agentchek test 1

Agent Checkup — Brain v1

session archive · 628 KB · uploaded 2026-08-31 21:43 UTC · browse · download

challenges  ·  10

complete · 10/10 collected

• letter-count-1

  How many times does the letter "n" appear in "znannkadonrn"? Answer with just the number.

  pass · 1answer: answer hidden on published runs46s

• decimal-compare-1

  Which decimal number is larger, 1.22 or 1.3? Answer with just the larger number.

  pass · 1answer: answer hidden on published runs51s

• arithmetic-1

  Compute step by step, left to right (no operator precedence): 20 - 12 / 4 + 11 - 12. Answer with just the final number.

  pass · 1answer: answer hidden on published runs57s

• unit-convert-1

  Convert 15 km to m. Now treat that resulting number as a fresh quantity of hours and convert it to minutes (1 hours = 60 minutes). Answer with just the final integer number of minutes.

  pass · 1answer: answer hidden on published runs63s

• format-json-1

  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 "7767". "checksum" must be a JSON number (not a string) equal to the sum of the digits of 7767. Example shape: {"answer":"1234","checksum":10}

  pass · 1answer: answer hidden on published runs69s

• math-add-1

  What is 4 + 0? Answer with just the number.

  pass · 1answer: answer hidden on published runs74s

• math-sum-1

  Compute the exact sum of 232 + 124. Respond with just the integer.

  pass · 1answer: answer hidden on published runs80s

• math-expression-1

  Evaluate this expression exactly and respond with just the integer: ((7 + -10) * (19 - 25)) + (7 * 6) - 14

  pass · 1answer: answer hidden on published runs89s

• math-determinant-1

  Compute the exact determinant of this 4x4 matrix. Respond with just the integer. [-3, -5, 5, -9] [-1, 11, 7, -3] [8, 0, 10, -2] [9, 0, 8, 6]

  pass · 1answer: answer hidden on published runs101s

• math-compute-1

  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 = [376834710, 3966100751, 2468937244, 1723933645, 2180439922, 541392539, 3512332312, 1060504825, 1144841614, 4034447975, 635652436, 871220837], x = 1462687978, y = 2131637363 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.

  pass · 1answer: answer hidden on published runs113s