Skip to main content
VerdictAI Benchmark
Back to Categories
Category Suite: Algorithmic

Code Golf Evaluation Benchmark

Byte-minified solutions, algorithm optimization, math solvers.

Top Model Leaders in Code Golf

Rank #1
Claude Opus 5 (Adaptive Reasoning, Max Effort)
58.9 / 100
Rank #2
Claude Opus 5 (Adaptive Reasoning, Xhigh Effort)
58.3 / 100
Rank #3
Claude Fable 5 (Adaptive Reasoning, Max Effort, Opus 4.8 Fallback)
58.1 / 100
Rank #4
GPT-5.6 Sol (max)
57.1 / 100
Rank #5
Claude Opus 5 (Adaptive Reasoning, High Effort)
57.1 / 100
Category Prompts & Benchmark Tasks (10)Zero-Shot & Multi-Turn Evals
#1 Minified Matrix Inversion Solver
Difficulty: Hard

Provide a byte-optimized JavaScript function that computes the determinant and inverse of an n x n matrix without external libraries.

#2 Shortest Maze Solver Algorithm
Difficulty: Hard

Write a minified JavaScript function under 150 bytes that finds the shortest path through a 2D grid maze using BFS or DFS traversal.

#3 Byte-Optimized JSON Parser & Serializer
Difficulty: Hard

Create a byte-minified standalone JSON stringifier/parser implementation in under 200 bytes handling nested objects, arrays, strings, and booleans.

#4 Compact Sudoku Solver
Difficulty: Hard

Write a minified Sudoku solver in JavaScript under 120 bytes that solves any valid 9x9 Sudoku puzzle using backtracking recursion.

#5 Golfed Markdown to HTML Parser
Difficulty: Medium

Create a byte-minified Markdown parser in under 180 bytes supporting bold, italics, headers (#), links, and code blocks using regex replacements.

#6 Minified Conway's Game of Life Core
Difficulty: Medium

Write a byte-minified Game of Life tick function in under 100 bytes that updates a 2D cellular automaton state array.

#7 Compact Expression Evaluator Shunting-Yard
Difficulty: Hard

Provide a minified math expression evaluator in JavaScript under 150 bytes handling precedence, parentheses, +, -, *, /, and ^ operators.

#8 Golfed Regex Engine String Matcher
Difficulty: Hard

Write a byte-minified regular expression matching function supporting , , and wildcards in under 140 bytes.

#9 Compact SHA-256 Hashing Algorithm
Difficulty: Hard

Create a byte-optimized JavaScript function implementing SHA-256 string hashing in minimal bytecode length.

#10 Minified Run-Length Image Compression
Difficulty: Medium

Write a byte-minified RLE (Run-Length Encoding) compressor and decompressor for 2D array matrix datasets in under 90 bytes.