Library Checker
Verify your algorithm library against strict tests for classic data structures and math
Library Checker is an online judge built for testing competitive programming libraries. Each problem is a well-known algorithmic task, such as a segment tree query, a convolution, a polynomial operation or a string algorithm, with large, carefully generated test cases, so passing means your implementation is both correct and fast.
Free · Browser · Advanced
About Library Checker
Problems are grouped into data structures, graphs, trees, strings, number theory, polynomials, linear algebra, geometry, big integers, combinatorics and more, with around 260 in total. It suits experienced competitive programmers building or porting a reusable library, and anyone who wants a reference benchmark for an implementation.
It runs in the browser and is free. All problem data, generators and reference solutions are open source on GitHub, so you can also run the tests locally.
Made this game? Claim it →
Tips and discussion
No tips yet.
Sign in to share a tip.