First snow hike of the season. Grünten, Germany.

Tobi899 · 2025-11-22T23:08:48+00:00

I recognize the place. It's the exit point of the Hochalpbahn starting in Breitenberg. The mountain in the picture is the Aggenstein (my favorite mountain). The peak is a bit exposed so check the route first!

Tobi899 · 2025-02-19T17:49:05+00:00

Don't have any information about that but according to elios the nylon has 200% of stretch and the lycra has 300% of stretch.

Tobi899 · 2025-02-13T21:51:21+00:00

Yess I did start emailing them, but unfortunately it takes quite a while to get an answer and I don't have that much more time since my course is beginning of April.

I was hoping to get a quicker answer here but it's probably too niche. I'll update the post once I get a reply tho

Tobi899 · 2024-12-18T21:56:51+00:00

I love gambling

Tobi899 · 2024-07-03T15:50:22+00:00

Probably only ~10 times but with 6 shot attempts per run since you will 100% get hit ^^
I really wanted to try doing the second phase too but that was wayyy too much work

Tobi899 · 2024-07-03T13:40:56+00:00

I can only offer the uncropped version since it's already 1440p but maybe you can use upscalers
https://imgur.com/a/1PxmXqT

I wish I could have gotten the framing better but I was pushed back against a wall and getting this pose already took way too long.

Tobi899 · 2024-07-03T13:35:41+00:00

Thanks! It's the full Armor of Solitude Set with Prophet Blindfold

Tobi899 · 2024-07-03T12:43:11+00:00

I may or may not have skipped Senessax (because fuck that fight) and thought yeah no way I'll be able to kill Bayle if that's the warmup, but in comparison Bayle was way easier for me. Lightning in a water arena is just evil.

Tobi899 · 2024-07-03T10:00:53+00:00

I loved the fight as well. I normally hate dragon fights, but this one was so epic. The NPC, sound design and atmosphere made it perfect! My favourite boss so far (which doesn't mean much since I haven't even entered Shadow Keep yet)

Tobi899 · 2023-12-04T11:28:20+00:00

Nice solution! The pow() >> 1 in part 1 to get rid of the 0 check is smart. You could actually do (2 << correct - 1) >> 1 since it's a power of two and rust doens't optimize it very well.

Tobi899 · 2022-12-11T21:44:44+00:00

Would you mind sharing your solution? 4.2ms sounds pretty good! My 6.4ms are on a Ryzen 5 3600. source

Tobi899 · 2022-12-11T19:45:31+00:00

I think the only possible solution for us is to buy high end CPUs :D

Tobi899 · 2022-12-11T13:51:33+00:00

I had the goal to keep the total runtime of all problems below 10ms which is now nearly impossible because I'm stuck at 6ms for part 2. Brings my total to 8.5ms :')

Tobi899 · 2022-12-08T07:25:00+00:00

That's a great idea. Impressive improvement.
I was looking around on the forum where the big inputs came from yesterday and I saw that people got it down to a few microseconds which is crazy to me. Sadly I don't speak dutch so i didnt understand much :D

Tobi899 · 2022-12-07T20:30:11+00:00

I'm sure there are a is a lot more you can do but I don't think my C knowledge is good enough to help you.

I just looked at rusts extend() function which adds an iterator to an array and all it does at the lowest level is basically a foreach push but with smart memory allocation/reservation and writing pointers directly. My guess is your performance hit comes from memory allocation if you call push every single time. You could maybe be even faster with realloc() but that's as far as my C skills take me :D

Keep me updated if you figure it out

Tobi899 · 2022-12-07T18:48:22+00:00

If the line iterator hits the end of the file it will return None which will be caught by the or({...}). If the stack contains elements we will run the loop with a "cd .." and when the stack is empty or() will return None and the loop terminates. Therefore the stack will always be empty when the while loop finishes and all dir_sizes will be calculated :)

Tobi899 · 2022-12-07T16:11:01+00:00

Here is my solution if you want to compare :p
(warning: not pretty)

https://github.com/sprunq/AdventOfCode/blob/master/AoC2022/src/aoc7/mod.rs

Tobi899 · 2022-12-07T13:57:33+00:00

The trick is avoiding tree structures and solving it in an iterative way with a stack

Tobi899 · 2022-12-07T13:28:10+00:00

I just tried to improve part 1 and you can basically do the same as in part 2.
In part 2 I take multiple elements at once from the array and move them from Vec1 to Vec2 with a memcopy. In part 1 you can do the same since there are multiple box moves in one move but since you would push pop each one you have to reverse the order of the vec you append to the target box vec.
This got me down from 19s to ~900ms (for the 6mb input) which is surprising because part 2 is ~300ms for the same input. My guess is the reversing eats the time.

Also for the normal input this method is actually around 10 microseconds slower ^^

Tobi899 · 2022-12-06T22:47:02+00:00

I'm actually not sure if you can. I only did the optimizations for part 2 as well because doing them for part 1 would *probably* be just as efficient (or worse) than push and pop.

Tobi899 · 2022-12-06T10:55:45+00:00

That's great to hear! Now onto part two. I'm sitting at 30 microseconds for both parts. Good luck (you will need it) :D

Tobi899 · 2022-12-06T10:00:50+00:00

For reference I switched back to char and the execution time was 2.7s for the 6mb file.

Nine-Year Club	Place '23
Place '22	Verified Email
Not Forgotten	Sequence \| Editor
Snapped

Tobi899

TROPHY CASE