A potential solution to this would be to introduce some form of proof of stake requirement. The submitters must be required to pay a certain sum to make a submission that will be returned to them along with the promised bounty. If the report is found to be fake, the original sum can be forfeited.
Posts by sreedev
went right over my head haha. my bad.
idk if you meant it sarcastically but there are some cool projects like supercollider and sonic-pi.
i recently also dicovered faust.grame.fr
the only O(1) solution. haha 😂
@tjdemuyt.bsky.social Thank you for that suggestion. Yes I did Fix that issue by using a custom type for each block that has an ID field. But the problem is the time complexity. I gotta try a different approach altogether.
@ked1108.bsky.social that's awesome. go for it. Implementing libraries in rust is fun. I implemented an SDK for pocketbase a while back github.com/sreedevk/poc...
A 100%. I thought the antenna antinode problem was going to be the ultimate edge case city (that turned out fine) until I saw today's problem
@ked1108.bsky.social yeah I agree with you, I did reach for rust multiple times during AOC this year, but I wanted to just stick with gleam to learn it. I implemented (badly of course) a lot of the functions that other languages typically of provide in the stdlib
@ked1108.bsky.social it brings me peace knowing I am not the only one haha. I am trying other approaches now.
#AdventOfCode Day 09: Disk Fragmenter #Gleam
github.com/sreedevk/adv...
Solution works on the example but not the input 😭
#AdventOfCode Day 08: Resonant Collinearity
This was a fun one, did not have to brute force anything today lol. #Gleam #BEAM
Still haven't optimized the solution, the solution in its current state runs in 676ms on average.
github.com/sreedevk/adv...
#AdventOfCode Day 07: Bridge Repair
Another day of parallelized brute forcing on the BEAM with #Gleam
github.com/sreedevk/adv...
I am gonna work on optimizing the solution. Right now Part 2 Execution Time is 28 seconds.
By only placing obstacles on the original path (Part 1), I was able to reduce the execution time to 1m. still working on optimizing it further.
htop screenshot showing core activity
My Solution for Day 6 Part 2 took 9m and 30s to run, but it worked! parallelization worked!
Thank you 14 cores and 20 threads.
Run the solution at your own risk, it may or may not leak memory.
github.com/sreedevk/adv...
#AdventOfCode #Gleam
Day 6 part 2 brute force works on the example but did not finish running on the input even after 2 minutes.
github.com/sreedevk/adv...
I could optimize the solution like a sane person, or I could use gleam/otp tasks and parallelize my problems.
parallelization it is!
#AdventOfCode #Gleam
Looks like #AdventOfCode Day 15 came early this year. My Part 1 Solution takes 6 seconds to run.
github.com/sreedevk/adv...
I don't have a solution for Part 2 so far, but I am leaning towards brute forcing. #Gleam #GuardGallivant
I did have to add a few list utility functions to make the solution look better. I didn't see any equivalents in the stdlib
github.com/sreedevk/adv...
Alright, #AdventOfCode Day 05 - Print Queue Done #Gleam
github.com/sreedevk/adv...
#AdventOfCode #Day04 #Gleam Done!
I got a little carried away with this one.
readability? never heard of it
github.com/sreedevk/adv...
saved by a “.pub”
#AdventOfCode #Day03 #Gleam Done! I was very tempted to try nibble (the string parsing library), but settled for regular expressions.
github.com/sreedevk/adv...
i too rolled out my own list.combinations lol
bsky.app/profile/sree...
Looking at some of the other solutions, i just realised that I can replace the entire variants function with just
list.combinations(report, list.length(report) - 1)
#AdventOfCode #Day02 #Gleam Done!
github.com/sreedevk/adv...
Just Completed #AdventOfCode 2024 Day 01 in @gleam.run ! github.com/sreedevk/adv...
Good day @sree.dev