Skip to main content

It’s that time of year again for Advent of Code.

I like to attempt it each year using FME (no python callers and no inlinequeriers). Sometimes it ends up easier with FME, sometimes it’s harder (and i think sometimes impossible)

If anyone would like to join the FME leaderboard the code is here

697463-34ac7156

Sneak preview of today’s solution. Happy that I only had to add one additional transformer for part 2

 

Today’s task was a really nice one to do with FME

 

@tino - i saw you mention advent of code yesterday, please feel free to join the board


Thx for the invite, but this year i am doing the AdventOfCode in Rust, including a side challenge with https://codspeed.io/advent . Not sure if should join your leader board then, because it is so uncomparable...


I'm happy for the invite to be for anyone involved with FME, no matter how they're solving the puzzles. 


@ebygomm sounds interesting! Where can I find this 'Advent of code’ ?


https://adventofcode.com/

 

They’re small programming puzzles that can be solved in whatever way you desire. 

 

I always like to try and attempt in FME and test it’s ‘no-code’ methods 


Reply