cl-competitive

Includes over 100 modules covering graph algorithms (e.g., Dinic's, Hopcroft-Karp), number theory, geometry, and string processing, as listed in the README, providing extensive coverage for competitive programming problems.

Code uses SBCL-specific extensions and 0-based indexing, optimized for speed in contests like AtCoder and yukicoder, as stated in the philosophy and test environment sections.

Algorithms are categorized into clear sections such as 'Unclassified data structures' and 'Arithmetic and algebra', facilitating easy reference and use, as seen in the detailed contents list.

Offers I/O optimization modules like read-fixnum.lisp and write-double-float.lisp, designed for faster input/output handling, which are crucial for meeting time limits in coding competitions.