Join us for the Advent of Code 2025
Briefly

Join us for the Advent of Code 2025
"What is Advent of Code? Advent of Code, created by Eric Wastl, is an annual event consisting of a series of Christmas-themed programming puzzles. The puzzles are released daily from December 1st through December 12th. The puzzles start easy and get harder as they go. The goal for participants is pure enjoyment. But also, you can sharpen your coding skills and improve your knowledge of your programming language of choice (which is Scala, of course)."
"Our Scala Center Advent of Code website is ready to go for 2025. Once the event begins, we will post a daily article for each puzzle, a day or two after you've had a chance to solve it yourself. Each article shows a sample solution and explains how it works. Articles are contributed by community members and vetted by the community and the Center."
"We want to showcase how Scala helps you write elegant solutions out-of-the-box, so the sample solutions will only use the Scala 3 standard library. If you would like to write one of the sample articles, you can volunteer on this page. Each day's article also includes links to alternate solutions. To add your own solution link, click "Edit this page" on a puzzle page to make a pull request adding a link to your solution."
The Scala Center supports Scala community participation in Advent of Code 2025, a 12-day series of Christmas-themed programming puzzles released daily from December 1st through December 12th. The event focuses on enjoyment and skill improvement, helping participants sharpen coding abilities and deepen knowledge of Scala. An #advent-of-code channel on the official Scala Discord Server provides discussion, solution sharing, help, and a link to a Scala-specific leaderboard. The Scala Center website will publish daily sample Scala 3 standard-library solutions and links to alternate solutions. Community members can contribute sample articles and add solution links via pull requests.
Read at Scala-lang
Unable to calculate read time
[
|
]