Bipedalwalker Locomotion Rl

category: Scientific Problems & ML

description: Train a CPU-only locomotion policy for BipedalWalker and its Hardcore variant. The judge evaluates only the submitted policy checkpoint, not the training process. Pre-trained policies and external RL libraries are prohibited.

metric: score (maximize)


Borden Source Inversion

description: Infer a finite-duration rectangular contaminant source from sparse, noisy monitoring-well observations in a 3D hydrogeological scene. The agent must implement its own forward model and inversion optimizer from scratch.


Dabic Gravity Inversion

description: Implement the D-ABIC regularization method for 3D gravity inversion within the SimPEG framework, run on both synthetic and real Vinton salt dome data under L0 and L1 sparse norms, and compare against a Hamiltonian Monte Carlo baseline.


Graph Node Classification

description: Implement graph neural networks from scratch using only base PyTorch for semi-supervised node classification on an unseen graph under CPU-only constraints.


Ann Vector Search Qps

category: Systems & Software Engineering

description: Replace a brute-force NumPy nearest-neighbor baseline with a high-performance approximate nearest-neighbor implementation under a hard recall constraint. Scored by queries per second.


Arc Compiler Runtime

description: Implement a complete TypeScript compiler pipeline (lexer, parser, type checker, code generator) for a novel programming language defined by specification documents.


Exchange Core Throughput

description: Maximize peak throughput of a Java financial matching engine built on the LMAX Disruptor by tuning thread topology, wait strategies, ring-buffer sizing, order-book implementation, and JVM configuration.


Ffmpeg Swscale Reimplementation

description: Reimplement FFmpeg's libswscale pixel-format conversion and scaling library in Rust, handling multiple pixel formats and scaling algorithms. A correctness-passing scaffold is provided; the agent must optimize for speed via SIMD.


Git Rewrite In Zig

description: Reimplement git as a drop-in Zig binary producing identical CLI output, exit codes, and repository state as the C reference implementation. The C source is available for reading but cannot be compiled.


Integer Compression Codec

description: Improve a C++ integer compression codec for better compression ratio and decode throughput on uint32 datasets via techniques such as delta encoding, bit-packing, and SIMD vectorization. Exact round-trip correctness is mandatory.


Juliet Vulnerability Analyzer

description: Implement a deterministic static analyzer that processes structured program facts to detect vulnerabilities across six CWE categories (stack/heap overflow, integer overflow, null dereference, use-after-free, command injection).


Rust Multicrate Reconstruction

description: Reconstruct missing Rust implementations across a multi-crate content-addressable storage workspace, given only type signatures and public API contracts.


Schemathesis Config Modernization

description: Implement six modernization targets in Schemathesis: a TOML-based configuration system with auto-discovery, API namespace reorganization, a metrics framework, transport and response abstractions, and a redesigned check registration system.

metric: pass rate


Schemathesis Datagen Pipeline

description: Implement eight feature targets in the Schemathesis Python API testing framework, including structured HTTP header generation strategies, coverage-phase hooks, discriminator-aware validation and data generation, and schema-driven code generation fixes.


Schemathesis Reporting Observability

description: Implement five targets in Schemathesis: a post-validation hook system, multi-format test report writers (VCR, HAR, JUnit, NDJSON), pytest plugin integration, and schema-branch-aware example generation.


Vliw Kernel Optimization

description: Optimize a VLIW/SIMD kernel generator for correctness and minimum cycle count on a custom architecture simulator. Hard-coded answers for specific inputs are forbidden.

metric: score (minimize)


Ad Placement Optimization

category: Combinatorial Optimization

description: Partition a large integer grid into non-overlapping rectangles, each containing a designated anchor point, maximizing total satisfaction from how closely each rectangle's area matches its target.


Apple Incremental Game

description: Decide each turn whether to invest in machines or collect output in an incremental production game, balancing short-term gains against long-horizon compounding.


Equivalence Class Divide And Conquer

description: Solve six progressive competitive-programming problems centered on equivalence classes and divide-and-conquer, where techniques from earlier problems inform solutions to harder ones.


Grid Turing Robot

description: Design transition rules and initial coloring for a Turing-like robot on a colored grid to maximize the number of distinct cells visited while minimizing the rule set size.


Jagua Nesting Optimization

description: Improve a Rust-based 2D irregular bin packing optimizer for non-convex polygonal pieces. Solution geometry is independently verified; improvements below a minimum threshold receive no credit.


Molecular Self Assembly

description: Schedule bonding operations over discrete time steps to assemble atoms into a specified number of connected molecules, respecting spatial proximity and temporal ordering constraints.


Order Addition Permutation Optimization

description: Find a permutation of 1,000 elements that minimizes a black-box cost function, using metaheuristic search (simulated annealing, genetic algorithms, local search) without access to the cost function's internals.


Smt Solver

description: Build an SMT solver from scratch for four quantifier-free theories (uninterpreted functions, linear real and integer arithmetic, and their combination). External SMT solvers are forbidden; model witnesses are independently validated.


Treant Forest

description: Strategically place obstacles in a grid maze to maximize the shortest-path length between start and goal, or block the path entirely.


Tree Block Partitioning

description: Solve six progressive problems on tree decomposition and block partitioning, where algorithmic ideas discovered in simpler variants transfer to harder ones.


Triangulation Coloring Optimization

description: Minimize a cost function over a triangulation by jointly recoloring vertices and flipping edges, where the dominant term is a quadratic penalty on monochromatic (``ugly'') triangles.


Vehicle Routing Time Windows

description: Implement a capacitated vehicle routing solver with time windows for Solomon-style benchmarks. Scored against best-known solutions on vehicle count and total travel distance.


Vibrating Path Graph Coloring

description: Color graph vertices and selectively remove edges to minimize a cost that penalizes both removed edges and monochromatic surviving edges.


Warehouse Forklift Routing

description: Route a forklift in a grid warehouse to receive goods arriving in random order, store them, and dispatch them in sequential order, minimizing total movement.


Wireless Electricity Layout

description: Position wire segments on a 2D plane to deliver wireless electricity from two fixed source plates to thousands of cities, minimizing a quadratic cost over city-to-wire distances and wire displacements while avoiding short circuits.


College English Exam Bank

category: Professional Knowledge Work

description: Produce five parallel examination papers with answer keys for a college English course, plus a blueprint table and an overlap self-check matrix ensuring cross-paper diversity meets pedagogical thresholds.


Cta Risk Budget Optimization

description: Build a complete CTA multi-strategy futures trading system: multiple signal classes, dynamic risk budgeting, a multi-currency backtest engine with transaction costs, drawdown control, and performance attribution.


K12 Math Recommendation

description: Build a knowledge-tracing and question-recommendation system from hundreds of thousands of student interaction records, evaluated on prediction accuracy, mastery calibration, learning gain, and pedagogical constraint satisfaction.


Portfolio Risk Calibration

description: Implement a multi-module portfolio management system (risk calibration, constrained optimization, execution cost modeling, dynamic rebalancing) for a cross-asset ETF portfolio. Evaluated out-of-sample on risk-adjusted return metrics.


Carleson Formalization

category: Formal Math & Theorem Proving

description: Fill proof obligations in the Lean 4 formalization of Carleson's theorem on pointwise convergence of L^2 Fourier series. Transitive axiom checking ensures no dependence on unproved prerequisites.


Combinatorial Games Formalization

description: Resolve proof obligations in a Lean 4 formalization of combinatorial game theory, covering surreal numbers, game arithmetic, and the Sprague-Grundy theorem.


Flt Regular Formalization

description: Resolve proof obligations in a Lean 4 formalization of Fermat's Last Theorem for regular primes via Kummer's cyclotomic theory. Top-level results earn no credit unless foundational prerequisites are also fully proved.


Lean Analysis Proofs

description: Complete proof obligations across a multi-file Lean 4 project formalizing results in real and functional analysis. Proofs are checked transitively: a theorem counts only if its entire dependency chain is fully proved.


New Foundations Consistency

description: Complete proof obligations in the ConNF Lean 4 project formalizing the consistency of Quine's New Foundations, involving permutation models and tangled type theory.


Ordinal Notation Well Foundedness

description: Construct well-foundedness proofs for ordinal notation systems in Coq, involving Cantor Normal Form and ordinal arithmetic.


Pfr Formalization

description: Resolve proof obligations in the Lean 4 formalization of the Polynomial Freiman–Ruzsa conjecture (Gowers–Green–Manners–Tao 2023), involving Shannon entropy, Ruzsa distance, and subgroup covering arguments.


Sphere Eversion Formalization

description: Complete proof obligations in a Lean 4 formalization of sphere eversion, spanning smooth immersions, jet bundles, ample differential relations, and convex integration.


Anchorhead Text Adventure

category: Interactive Games & Simulators

description: Play the Lovecraftian interactive fiction game Anchorhead via an HTTP API, sending text commands and receiving prose observations. Scored by peak in-game score, reflecting progression through the multi-day narrative and puzzle chain.

metric: game score


Dcss Dungeon Ai

description: Write a Lua bot for Dungeon Crawl Stone Soup that autonomously explores, fights, and descends dungeon levels as a Minotaur Berserker under a wall-clock time budget. Scored by mean in-game score across multiple runs.


Nethack Dungeon Agent

description: Implement a decision policy for NetHack via the NLE harness, parsing ASCII map observations and stat vectors to navigate, fight, and survive across multiple procedurally generated runs.


Openrct2 Theme Park Ai

description: Write a JavaScript plugin for OpenRCT2 that autonomously builds rides, hires staff, sets pricing, and grows park company value across multiple scenarios of increasing complexity.


Openttd Transport Ai

description: Write an AI script for OpenTTD that builds road, rail, and air transport networks to connect towns and industries and grow company value across diverse procedurally generated maps.


Trinity Text Adventure

description: Play Infocom's Trinity via an HTTP game API. The game requires precise object manipulation and understanding of symbolic and temporal clues across interconnected zones.


Tryst Text Adventure

description: Play Tryst of Fate via an HTTP game API. The branching narrative with irreversible choices requires strategic exploration to reach high-scoring endings.


Wesnoth Tactical Ai

description: Write tactical AI logic for Battle for Wesnoth that defeats the built-in AI through custom recruitment, focus-fire targeting, terrain exploitation, and village-capture timing across multiple maps.