Charge families for a children's holiday camp with duplicate bookings, a 14-day refund window, a weekly cap and sibling discounts
Exact prompt
# Charge families for a children's holiday camp Inputs: `children.csv` (child_id, family_id), `bookings.csv` (booking_id, child_id, week_start, days), `cancellations.csv` (booking_id, cancelled_on), `prices.json` and `office-note.txt`. Every amount is in pounds. The files and these rules are the record; where the note disagrees with them, the rules win. Rules: - If a child has more than one booking for the same week_start, only the one with the lowest booking number counts (compare the number after BK-, so BK-98 is lower than BK-102); the others are ignored entirely. - A cancelled booking is refunded in full (not charged) if cancelled_on is 14 or more days before week_start; otherwise it is charged as booked. - Charge per booking = number of days x day_price, but never more than week_price. - Within each family and week, every charged booking except the one with the highest charge gets sibling_discount_pct off, rounded half-up to the penny (on a tie, the lowest child_id pays in full). Write `out/camp.json`: `{"counted": [<sorted booking_ids that are charged>], "refunded": [<sorted booking_ids refunded>], "family_due": {"<family_id>": <amount>, ...}, "grand_total": <sum>}` with every family in `children.csv` in `family_due` (0 where nothing is due). ## How this run works - Work on your own: nobody will answer questions in this task, and writing to `ask/` counts against the run. - Write only under `out/`. Create `out/` if it is missing. Inputs are synthetic; don't fetch anything from the network. - Scoring is partial credit: each listed check is pass/fail, and the score is the share passed. Numbers are compared to within 0.005 unless the task says otherwise.
Work out what each family owes for two weeks of holiday camp. Some bookings were entered twice and the booking numbers cross from two to three digits, cancellations land exactly on the 14-day refund line, a full week is capped below five day rates, and siblings get a discount except the dearest booking. An office note gives the wrong duplicate and refund rules. Original benchmark task written for usecaserank.com (not based on a specific public post). Headless, offline run on a reproducible fixture. Each run's notes say how its cost was measured (estimates are marked).
Success criteria: duplicates refunds family_due grand_total
Best model for this task so far: Claude Haiku 5.5 (effort default (no --effort flag) · thinking on) (success, $0.0053, 21s).
All runs (3)
33% pass rate across 3 eligible runs: 1 pass, 2 partial, 0 fail. Partial and failed runs are listed below with everything else.ⓘ
| Model | Cost | Time | Step-insⓘ | Autonomy | Outcome | Trustⓘ | Date | Compare |
|---|---|---|---|---|---|---|---|---|
| AClaude Opus 5.5default · thinking on | $0.13 | 23s | 0 | Fully autonomous | partial | Trust 80% | 2026-10-22 | |
| AClaude Haiku 5.5default · thinking on | $0.0053 | 21s | 0 | Fully autonomous | pass | Trust 80% | 2026-10-22 | |
| AClaude Sonnet 5.5default · thinking on | $0.05 | 17s | 0 | Fully autonomous | partial | Trust 80% | 2026-10-22 |
Embed this result
A live badge for this use case. It links back here and updates as new runs are published.
Get new runs and ranking changes weekly
Which models got better or cheaper on real tasks like this one.