All tasks

Pairwise AUC Calculator

PythonHardClorvin Labs original task

The ranking report needs binary AUC without treating equal scores as fully correct or fully wrong. Implement the calculation with the defined half-credit rule for ties.

Build the implementation in Python under /app, with /app/run.sh as its entry point. Read one JSON request from standard input and write one JSON result to standard output. Input is a list of score/label records. Scores must be finite numbers and labels exactly integer 0 or 1. Compare every positive-negative pair: score 1 for higher positive score, 0.5 for a tie, otherwise 0. Return the mean rounded to six decimals. Require at least one positive and one negative; reject invalid samples.

Reject inputs that violate an explicit validation rule with exit status 2, no standard output, and {"error":"invalid_input"} on standard error. For valid input, exit with status 0. Keep the implementation reusable for new inputs; it must work offline and must not depend on the example data being the only data it receives.

Repair or replace the unfinished /app/run.sh and add source files under /app. Malformed JSON must use the same invalid-input response. Do not read /tests or /oracle from the application.

Inspect the checks. Explore the results.

9 recorded reference checks

Review the checks and explore the evaluation view for pairwise auc calculator.

Example dataExplore the controls with illustrative values. These are not recorded GPT-5.5 or Opus 4.8 results.
Read the example values
Illustrative reward values, not model test results
AttemptGPT-5.5 (demo)Opus 4.8 (demo)
100.25
20.250.5
30.50.5
40.751
50.50.75
610.75
70.751
811

Tell us what needs doing.

Share the scope, the expected volume and your timeline.
We’ll work out where our team can help.