HackerRank-Bench / Technical report

AI can write code. Can it do the engineering?

Benchmarking frontier AI models on private, real-world, long-horizon engineering tasks.

Model performanceScore (%)
Mean verified score across all tasks and runs. Each run receives partial credit for the checks it completes.

HackerRank-Bench is a private, long-horizon benchmark. It tests frontier models on diverse, real-world, complex engineering work across complete software systems. This is the kind of work that public coding benchmarks often miss.

  • Original tasks. We wrote every task from scratch. None of them come from public commits or pull requests. So the solutions are unlikely to be in any model's pretraining data.
  • Complete software systems. Tasks include greenfield builds, brownfield changes, migrations, identity, frontend, and privacy-sensitive work.
  • The same environment for every model. Every run happens in the same reproducible setup, so results are fair to compare.
  • Scored on behavior. We write every verifier by hand. Verifiers check how the software behaves, not how the code is structured.

On these tasks, the strongest model completes about half of the verified behavior, and most complete less than 40%. AI can do part of the engineering, but not yet all of it.

Model efficiency and execution

Compare each model configuration’s verified score with its cost, duration, or token usage per task.

Score vs costCost efficient

Score (%)

Cost per task (USD, log scale)

Performance by task type

Models do not perform equally well on every kind of task. The top model for migrations is not the top model for frontend work. The charts below show the leading models for each task type.

Top models by task type

The five highest-scoring configurations for each task type.

Greenfield implementation

Building a working system from a specification, without an existing implementation to anchor decisions.

  1. Claude Opus 5.5high reasoning
    60.12%
  2. GPT-6 Astrahigh reasoning
    53.14%
  3. Claude Opus 5high reasoning
    45.45%
  4. Kimi K3high reasoning
    40.84%
  5. GPT-5.6 Solhigh reasoning
    39.35%

Brownfield modification

Extending an existing codebase while preserving behavior that other parts of the system already depend on.

  1. Claude Opus 5.5high reasoning
    48.13%
  2. GPT-6 Astrahigh reasoning
    44.82%
  3. GPT-5.6 Solhigh reasoning
    41.90%
  4. Claude Opus 5high reasoning
    41.85%
  5. Kimi K3high reasoning
    38.99%

Migration & behavioral parity

Reproducing expected behavior across an implementation, framework, or runtime boundary.

  1. Claude Opus 5high reasoning
    35.42%
  2. Claude Sonnet 5high reasoning
    33.40%
  3. Claude Opus 5.5medium reasoning
    31.37%
  4. Kimi K3high reasoning
    29.01%
  5. GPT-5.6 Solhigh reasoning
    28.72%

Identity & provisioning integration

Implementing standards-based identity lifecycle and synchronization across tenant boundaries.

  1. Claude Opus 5.5high reasoning
    65.64%
  2. GPT-6 Astrahigh reasoning
    60.26%
  3. Claude Opus 5high reasoning
    58.07%
  4. Qwen 3.8high reasoning
    55.78%
  5. GPT-5.6 Solhigh reasoning
    55.28%

Frontend & interaction fidelity

Building visual, stateful interactions while preserving rendering and input behavior.

  1. GPT-5.6 Solhigh reasoning
    65.31%
  2. Claude Opus 5.5high reasoning
    62.30%
  3. Claude Opus 5high reasoning
    60.67%
  4. Kimi K3high reasoning
    60.15%
  5. Gemini 3.7 Flashhigh reasoning
    59.39%

Privacy & data lifecycle

Making correct, safe, and complete changes to how sensitive data is handled end to end.

  1. GPT-6 Astramedium reasoning
    34.37%
  2. Claude Opus 5.5high reasoning
    30.62%
  3. GPT-5.6 Solhigh reasoning
    28.53%
  4. Claude Opus 5high reasoning
    25.62%
  5. GLM 5.2high reasoning
    25.41%

Methodology

This section describes how we designed the tasks, ran the models, and scored each run. All tasks, verifiers, scoring weights, and environment settings were fixed before any model was evaluated. Each combination of model and reasoning level is treated as a separate configuration.

Evaluation package

Every benchmark task combined three separately versioned components.

PRD-style instruction

A product or engineering brief defined the required behavior, operating constraints, and acceptance boundaries without prescribing one implementation.

Execution environment

A versioned, runnable workspace provided the codebase, services, dependencies, data stores, browser tooling, and a consistent initial state.

Private verifier

A hand-written evaluation package contained hidden fixtures, behavioral checks, criterion weights, and the evidence contract used to produce the score.

Task design and dataset

Each task asks for work across a whole software system, not a single file or function. The prompts, test data, and verifiers stay private, so the solutions are unlikely to appear in any model's training data. The tasks cover six types of engineering work.

  1. Greenfield implementation

    Building a working system from a specification, without an existing implementation to anchor decisions.

  2. Brownfield modification

    Extending an existing codebase while preserving behavior that other parts of the system already depend on.

  3. Migration & behavioral parity

    Reproducing expected behavior across an implementation, framework, or runtime boundary.

  4. Identity & provisioning integration

    Implementing standards-based identity lifecycle and synchronization across tenant boundaries.

  5. Frontend & interaction fidelity

    Building visual, stateful interactions while preserving rendering and input behavior.

  6. Privacy & data lifecycle

    Making correct, safe, and complete changes to how sensitive data is handled end to end.

Example task

Implement GDPR erasure across a distributed payment system

Build an asynchronous workflow that removes or anonymizes a customer’s personal data across connected systems while preserving required financial records and data belonging to other customers.

Task contract

Accept a customer data deletion request, expose its progress, clean every active data store, and report completion only when the customer’s personal data is no longer available.

Evaluation

The verifier checks behavior through the public API and running services. Different implementations can pass if they satisfy the same contract.

  1. 01
    Request behavior

    Tests normal, duplicate, concurrent, invalid, and cross-tenant requests.

  2. 02
    Data removal

    Checks each active data store and emitted payload for the customer’s personal data.

  3. 03
    Replay safety

    Runs delayed work and historical events to confirm erased data does not return.

  4. 04
    Business safety

    Runs refunds and isolation checks to confirm required records and unrelated data still work.

Why this task is difficult

Personal data is spread across several systems, but some financial records must remain. The solution must remove personal data and identifiers everywhere without disrupting refunds, audit history, or data belonging to other customers.

Environment

Every run starts from the same saved workspace, with identical code, services, data, and tools. All models operate through the same agent harness, OpenHands. The verifier is never visible to the model. It is added only after the model finishes, in a fresh container. Each configuration was run three times on every task, because results vary from run to run. Runs that failed because of the model provider or the environment, such as API errors or container crashes, were discarded and repeated. The leaderboard reports the average score across all runs, with a line marking the lowest and highest of the three attempts.

Verifiers

Each verifier evaluates what the software does, not how the code is written. Two kinds of verifier are used, depending on how precisely the task can be specified in advance.

Fixed contract

Deterministic verification

Used when the task specifies the exact API and expected behavior.

What stays fixed
The endpoints, inputs, outputs, and error rules.
How it checks
Hidden tests exercise the running system through its API, the browser, and its data stores.
What sets the score
Test results only. File names and code structure are not considered.

Adaptive contract

LLM-mapped verification

Used for open-ended tasks, where two valid solutions may expose different APIs or screens for the same feature.

What stays fixed
The features under test, the test scenarios, the weights, and the pass criteria.
How it checks
The verifier first reads the solution’s own API documentation and setup file. A language model then identifies the remaining details, such as which endpoint or button performs each function. The same fixed tests are then run against that map. The language model and its settings are identical for every run.
What sets the score
Test results only. The language model only locates what to test. It cannot add requirements or award points.

Testing the verifiers

Verifiers are written by hand by expert engineers and validated before use. A reference solution must receive the full score. We then introduce defects into that solution, one at a time, and confirm that the verifier catches each one. Finally, we run the verifier against multiple independent implementations to confirm that it rewards the same behavior regardless of how the code is structured.

Weighted behavioral scoring

Each task is divided into separate checks, and each check is assigned a weight. Behavior that is more important or harder to get right receives a larger weight. A run’s score is the weighted share of checks it completes.

Task score for one run

Scorer,t=100×NtΣi=1wt,ipr,t,iNtΣi=1wt,i
r, t
Independent run r on task t
Nt
Number of scored behavioral checks in task t
wt,i
Predefined weight of check i
pr,t,i
Observed completion in [0, 1]: 1 for complete, 0 for absent or incorrect, and an intermediate value for partial completion

Partial credit

Scores are not binary. A partly working system receives partial credit rather than a zero. Credit is awarded only for behavior the verifier directly observes.

Key findings

Cost rises faster than performance

The highest score comes at a much higher cost, while GPT-5.6 Luna Medium delivers the strongest score per dollar.

Coding agents use git more to inspect changes than to save or restore them

Inspection accounted for 80.83% of recorded Git requests. Models differed in how often they requested staging and commits, while undo and stash operations made up just 0.49% overall.

Tool call sequence reveals distinct inspect, edit, and check rhythms

The runs show two contrasting rhythms: some repeatedly inspected files, while others moved through short edit-and-check cycles. The balance between those patterns differed across model groups.

How leading models approach implementation

In both the Claude and GPT families, the highest-scoring model took fewer steps, created fewer files, and made fewer tool calls.

When activity stops translating into progress

Scores varied across runs, and some traces spent substantial time repeating checks or revisiting the same work without clear progress.

How agents build from requirements without an existing codebase

Given a list of requirements and a prepared environment, agents had to build the entire application from scratch. Some inspected the environment and planned the structure before writing code; others began implementing sooner. Some checked complete workflows as they built, while others concentrated on local edits, repeated builds, and restarts.

What reasoning buys depends on the task type

High reasoning helped on brownfield tasks, such as code migration and SCIM integration, where agents worked with an existing codebase. On greenfield tasks, where the application had to be built from scratch, increasing reasoning effort produced only a small score gain. For the greenfield application, the relative increase in wall-clock time was roughly twice that of SCIM integration (16.1% versus 8.4%).

Where implementations leave room to improve

Across system integration and interactive application development, results show room to improve in workflow completeness, state management, and interaction accuracy.

Lower token rates don’t guarantee lower total costs

Total cost reflects token volume, model rates, and cache reuse, so lower token rates alone do not guarantee a lower bill.

Equal scores can hide maintainability trade-offs

In one specific comparison, we noticed that Qwen 3.8’s modular backend and GPT-5.6 Sol’s single-file backend earned the same 12.45% score. Qwen spread the backend across 18 production Go files, while Sol kept it in 1 file and still handled edits well enough to match the behavioral result. We report this outcome without endorsing the single-file approach.

Models passed REST checks but struggled with WebSocket checks

The table shows the percentage of each model’s implementations that passed the REST or WebSocket checks. Most models reached 100% on REST checks, while pass rates for WebSocket checks ranged from 0% to 75%. Every model had a lower pass rate on WebSocket checks, suggesting a shared weakness in implementing stateful, live connections.

Limitations

The results should be interpreted within the scope of this benchmark and its execution protocol.

  • All models were evaluated with OpenHands under a common execution standard and a fixed set of harness capabilities. Performance may differ in model-native environments, including Codex CLI, Claude Code, Cursor, and Gemini CLI.
  • The benchmark emphasized long-horizon, system-level engineering tasks. Bug fixes and refactoring were underrepresented. Both can also be challenging for models.
  • Aggregate scores may obscure variation across task types and failure modes.
  • Costs reflect provider API prices at the time of evaluation and may change as pricing changes.

Our offerings

OTS SWE Data

470M graded submissions, across 2000+ questions, spanning 30+ programming languages.

This is community driven human data that developers use to prepare for interviews.

Agent Traces

Every month we host Orchestrate, a community hackathon where 30k+ participants take on a complex long horizon SWE challenge.

Gives us trajectories on the performance of the latest frontier models on complex software engineering.

RL Gyms

Executable environments for repository-scale, long-horizon agent training and evaluation.

Built on HackerRank’s experience creating practical, verifiable engineering assessments.

Private Benchmarking

HackerRank can run benchmarks on long horizon problem sets that have never touched the public internet, each paired with real human expert performance trajectories wherever required.