Bill a month of car park sessions with per-day caps across midnight, shop validations and a grace period
Exact prompt
# Bill a month of car park sessions Inputs: `sessions.csv` (every entry/exit recorded by the barrier in October 2026, with whether a shop validated the ticket) and `tariff.json`. Charge each session: - Each calendar day a session touches is charged separately: the tariff's price per started hour on that day, capped at the tariff's daily cap for that day. A day piece runs from entry (or midnight) to exit (or midnight); a piece of 0 minutes costs nothing. - A validated session gets its first `validation_free_hours` hours free: take them off the first day's piece before counting started hours (any free time left over does not move to the next day). - A session shorter than `grace_minutes` minutes from entry to exit is free. - A started hour is any part of an hour: 61 minutes is 2 started hours, 60 minutes is 1. Write `out/parking.json`: `{"charges": {"<session_id>": <amount>, ...}, "by_plate": {"<plate>": <total for that plate>, ...}, "total": <sum of all charges>}` with every session listed (free ones as 0). ## 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.
Charge every barrier session in a month of a pay-on-exit car park. Each calendar day a stay touches is priced by started hour and capped separately, a shop validation takes free hours off the first day only, and very short stays are free. One cap for a whole multi-day stay, rounding to the nearest hour or charging grace-period stays each change the bill. All amounts are whole multiples of the tariff, so no rounding is involved. 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: midnight_split validation grace started_hours
Best model for this task so far: Claude Haiku 5.5 (effort default (no --effort flag) · thinking on) (success, $0.0052, 18s).
All runs (3)
100% pass rate across 3 eligible runs: 3 pass, 0 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.12 | 17s | 0 | Fully autonomous | pass | Trust 80% | 2026-10-22 | |
| AClaude Haiku 5.5default · thinking on | $0.0052 | 18s | 0 | Fully autonomous | pass | Trust 80% | 2026-10-22 | |
| AClaude Sonnet 5.5default · thinking on | $0.06 | 12s | 0 | Fully autonomous | pass | 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.