# Solving the "Impossible" in ClickHouse: Advent of Code 2025

DevFeed: [Solving the "Impossible" in ClickHouse: Advent of Code 2025](<https://devfeed.tech/articles/solving-the-impossible-in-clickhouse-advent-of-code-2025-5061.md>)

Original publisher: [Read original article](<https://clickhouse.com/blog/clickhouse-advent-of-code-2025>)

Author: Zach Naimon

Published: 2025-12-31T00:00:00Z

Content type: article

Language: en

Sources: [ClickHouse Blog](<https://devfeed.tech/sources/clickhouse-blog.md>)

Topics: [Advent of Code](<https://devfeed.tech/topics/advent-of-code.md>), [C++](<https://devfeed.tech/topics/c-plus-plus.md>), [Go Language](<https://devfeed.tech/topics/go-language.md>), [Bash](<https://devfeed.tech/topics/bash.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [ascii](<https://devfeed.tech/tags/ascii.md>), [clickhouse](<https://devfeed.tech/tags/clickhouse.md>), [database](<https://devfeed.tech/tags/database.md>), [sql](<https://devfeed.tech/tags/sql.md>)

## AI overview

The article describes solving Advent of Code 2025 puzzles with a single pure ClickHouse SQL query. It outlines constraints including raw-input parsing and no UDFs or intermediate tables.

## Source excerpt

At ClickHouse, we don't like the word "impossible." We believe that with the right tools, everything is a data problem. To prove it, we decided to complete the 2025 Advent of Code unconventionally: using pure ClickHouse SQL.