Safi K
12/05/2023, 8:49 PMRiccardo Lippolis
12/05/2023, 8:50 PMDan Fingal-Surma
12/05/2023, 8:57 PMSafi K
12/05/2023, 8:57 PMSafi K
12/05/2023, 8:57 PMDan Fingal-Surma
12/05/2023, 8:58 PMSafi K
12/05/2023, 8:59 PMDan Fingal-Surma
12/05/2023, 8:59 PMSafi K
12/05/2023, 9:00 PMNeil Banman
12/05/2023, 9:04 PMSafi K
12/05/2023, 9:09 PMDan Fingal-Surma
12/05/2023, 9:09 PMSafi K
12/05/2023, 9:10 PMCharles Flynn
12/05/2023, 9:18 PMSafi K
12/05/2023, 9:39 PMSafi K
12/05/2023, 9:40 PMNeil Banman
12/05/2023, 9:41 PMSafi K
12/05/2023, 9:44 PMSafi K
12/05/2023, 9:45 PMDan Fingal-Surma
12/05/2023, 9:45 PMSafi K
12/05/2023, 9:46 PMNeil Banman
12/05/2023, 9:46 PMNeil Banman
12/05/2023, 9:47 PMDan Fingal-Surma
12/05/2023, 9:47 PMSafi K
12/05/2023, 9:48 PMNeil Banman
12/05/2023, 9:49 PMDan Fingal-Surma
12/05/2023, 9:50 PMSafi K
12/05/2023, 9:52 PMRiccardo Lippolis
12/05/2023, 9:52 PMNeil Banman
12/05/2023, 9:54 PMHaha you guys are right. But the problem is that I haven't learned a lot about data structures, algorithms or optimization methods yet.Don't let that stop you! My last computer class was in high school in 1995. And I'm a lawyer, not a programmer. You learn by doing (and asking for help... and reading wikipedia...)!
Safi K
12/05/2023, 9:54 PMRiccardo Lippolis
12/05/2023, 9:55 PMNeil Banman
12/05/2023, 9:55 PMDan Fingal-Surma
12/05/2023, 9:56 PMDan Fingal-Surma
12/05/2023, 9:57 PMSafi K
12/05/2023, 9:58 PMDon't let that stop you! My last computer class was in high school in 1995. And I'm a lawyer, not a programmer. You learn by doing (and asking for help... and reading wikipedia...)!That's true, thank you. I will try to start solving problems earlier tomorrow, so I'll have more time to find better solutions and optimizations. Right now, I really am in a hurry..
Safi K
12/05/2023, 10:02 PMdon't give up, even if you don't succeed at solving all the problems every day, it's all about learning and having fun..Thank you, I'll try my best. I was not able to solve day three's second part because I misunderstood something, so I moved on to day 4 anyways, and now to day 5. Yeah, comparing to others is the worst. I do it sometimes but with IG models actually, than other programmers lol 😂 And it's my first year doing AoC.
Charles Flynn
12/05/2023, 10:03 PMSafi K
12/05/2023, 10:03 PMSafi K
12/05/2023, 10:04 PMJohannes Gätjen
12/05/2023, 10:06 PMNeil Banman
12/05/2023, 10:07 PMYes one of the guidelines is “every problem has a solution that completes in at most 15 seconds on ten-year-old hardware”The funny thing is that the most compute-intensive problems are in the early years when 10 year old computers were ancient by today's standards. All that MD5 hashing... hard to come up with a shortcut for those. I got 2016 day 14 down to 2 seconds (cold start) using parallelism on my 2018-era Ryzen 5 CPU. In 2006, Intel had just released their first dual-core desktop offering. I can't imagine doing that many hashes on that in 15 seconds without getting awfully close to bare metal.
Safi K
12/05/2023, 10:08 PMa tip for bruteforcing: have some periodic output to show the progress, that way you can estimate how much longer you need to wait. A friend of mine did today's problem the brute force way and waited one hour for the solution.Thank you, I had to do it now haha.