aoc-2022 VS adventofcode

Python 3 https://github.com/charlescochran/aoc-2022/blob/master/day_13.py I originally wrote a comparator function which pretty much worked exactly how the part 1 problem is specified, but then I realized that with sufficient hacking, you can coerce the packets to sort correctly using Python's built-in alphabetical sorting. This involves 1. wrapping all the integers in a bunch of lists such that they are all nested the exact same amount and 2. doing some string substitutions to handle certain edge cases. My program solves part 2 in about 30 ms (CPU time). I'm curious how that timing compares to anyone who just did a normal sort with the custom comparator function developed in Part 1 (using Python)?

The only code differs for two parts is as follows - https://github.com/bhosale-ajay/adventofcode/blob/master/2023/ts/D07.test.ts - under 80 lines.

Easy day TypeScript, P1 - Brute Force, P2 - Formula

[LANGUAGE: TypeScript] Github - Under 40 lines, all parts running under 8ms.

[LANGUAGE: TypeScript] TypeScript - Running under 30ms (both parts)

F# This year I solved puzzles using TypeScript as well as F# - Day 18, 19, and 22 TBD

F# - After looking at some Python solution calculated the position of blizzard for nth time instead of maintaining the grid, which makes it easier with F#.