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.
05.08.2025 22:25
๐ 1
๐ 0
๐ฌ 0
๐ 0
went right over my head haha. my bad.
11.12.2024 01:21
๐ 2
๐ 0
๐ฌ 1
๐ 0
idk if you meant it sarcastically but there are some cool projects like supercollider and sonic-pi.
i recently also dicovered faust.grame.fr
11.12.2024 00:51
๐ 0
๐ 0
๐ฌ 1
๐ 0
the only O(1) solution. haha ๐
09.12.2024 16:48
๐ 1
๐ 0
๐ฌ 0
๐ 0
@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.
09.12.2024 16:11
๐ 0
๐ 0
๐ฌ 0
๐ 0
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
09.12.2024 14:05
๐ 2
๐ 0
๐ฌ 0
๐ 0
@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
09.12.2024 14:02
๐ 1
๐ 0
๐ฌ 1
๐ 0
@ked1108.bsky.social it brings me peace knowing I am not the only one haha. I am trying other approaches now.
09.12.2024 13:47
๐ 0
๐ 0
๐ฌ 0
๐ 0
a man is sitting at a desk in a cubicle in front of a computer .
ALT: a man is sitting at a desk in a cubicle in front of a computer .
#AdventOfCode Day 09: Disk Fragmenter #Gleam
github.com/sreedevk/adv...
Solution works on the example but not the input ๐ญ
09.12.2024 13:40
๐ 10
๐ 0
๐ฌ 4
๐ 0
#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...
08.12.2024 14:05
๐ 5
๐ 0
๐ฌ 0
๐ 0
#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.
07.12.2024 14:32
๐ 3
๐ 0
๐ฌ 0
๐ 0
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.
06.12.2024 18:15
๐ 1
๐ 0
๐ฌ 1
๐ 0
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
06.12.2024 16:23
๐ 2
๐ 0
๐ฌ 1
๐ 0
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
06.12.2024 14:27
๐ 0
๐ 0
๐ฌ 1
๐ 0
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
06.12.2024 13:10
๐ 1
๐ 0
๐ฌ 1
๐ 0
saved by a โ.pubโ
03.12.2024 16:23
๐ 6
๐ 0
๐ฌ 0
๐ 0
#AdventOfCode #Day03 #Gleam Done! I was very tempted to try nibble (the string parsing library), but settled for regular expressions.
github.com/sreedevk/adv...
03.12.2024 13:20
๐ 4
๐ 0
๐ฌ 0
๐ 0
i too rolled out my own list.combinations lol
bsky.app/profile/sree...
02.12.2024 20:49
๐ 1
๐ 0
๐ฌ 0
๐ 0
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)
02.12.2024 14:33
๐ 0
๐ 0
๐ฌ 0
๐ 0
#AdventOfCode #Day02 #Gleam Done!
github.com/sreedevk/adv...
02.12.2024 13:46
๐ 2
๐ 0
๐ฌ 1
๐ 1
Good day @sree.dev
19.11.2024 14:38
๐ 1
๐ 1
๐ฌ 0
๐ 0