#AdVENt of Code
1 messages Β· Page 3 of 1
&string[index..]
.wk Benedict
1.ββ
β¦Harukeβ© - 2 plays
2.ββ
β¦happuβ© - 2 plays
3.ββ
β¦SanderNLβ© - 1 play
4.ββ
β¦kiritoβ© - 1 play
5.ββ
β¦fieryplace ππͺ΅π₯β© - 0 plays
fake fan
πββ
β¦Copemonβ© - 515 plays
β
2.ββ
β¦enjaitusβ© - 484 plays
β
3.ββ
β¦Glytcherβ© - 430 plays
β
4.ββ
β¦notwally(ΒΏ)β© - 182 plays
β
5.ββ
β¦Wowieβ© - 179 plays
β
6.ββ
β¦Musabβ© - 169 plays
β
7.βββ¦bunnieβ© - 168 plays
β
8.ββ
β¦izzy.β© - 160 plays
β
9.βββ¦patrickβ© - 127 plays
β
10.ββ¦Smugβ© - 124 plays
β
11.ββ
β¦Empridβ© - 116 plays
β
12.ββ
β¦bandit<3β© - 111 plays
β
13.ββ
β¦Xanβ© - 96 plays
β
14.ββ
β¦blinfβ© - 95 plays
**β
199.β
ββ¦fieryplace ππͺ΅π₯β©** - 0 plays
&&&&&&&&&&&&&&&&&&&&&&&&string[index..] == &&&&&&&&&&&&&&&&&&&&&&&i.0
fake fan
its true
THIS BOT IS SO WRONG
so many implicit deref
Sorry, you are not added to this server yet. Run /refreshmembers and try again.
true
.u
Nothing new found on your Last.fm profile since last update (<t:1701514376:R>)
nvm it does but it spawned a new error
*************&&&&&&&&&&&&&
β Cached memberlist for server has been updated.
This server has a total of 1980 registered .fmbot members.
.u
Nothing new found on your Last.fm profile since last update (<t:1701514359:R>)
.fmbot li pali...
.u
β Cached playcounts have been updated for FieryFlames based on 1244 new scrobbles.
*&*&*&*&*&*&*&*&***&*&&&*&*&***&&&
OH MY GOD
o pali wawa mute
.wk Olivia rodrigo
πββ
β¦escarβ© - 4081 plays
β
2.ββ
β¦mosdzxβ© - 2901 plays
β
3.ββ
β¦lyndsey!!β© - 1987 plays
β
4.ββ
β¦Blueberry Bubble Teaβ© - 1218 plays
β
5.ββ
β¦kieβ© - 1143 plays
β
6.ββ
β¦Bananasβ© - 1082 plays
β
7.βββ¦Pitachuβ© - 1025 plays
β
8.ββ
β¦Clydeβ© - 1007 plays
β
9.βββ¦Amyrianβ© - 943 plays
β
10.ββ¦maxicβ© - 786 plays
β
11.ββ
β¦papitoβ© - 753 plays
β
12.ββ
β¦Hazelβ© - 667 plays
β
13.ββ
β¦notwally(ΒΏ)β© - 601 plays
β
14.ββ
β¦ajgβ© - 598 plays
**β
56.β
ββ¦fieryplace ππͺ΅π₯β©** - 160 plays
ΓΌ
mi pali e mama sina
ilo nasa
okay thats better
.wk BENEE
πββ
β¦Copemonβ© - 515 plays
β
2.ββ
β¦enjaitusβ© - 484 plays
β
3.ββ
β¦Glytcherβ© - 430 plays
β
4.ββ
β¦notwally(ΒΏ)β© - 182 plays
β
5.ββ
β¦Wowieβ© - 179 plays
β
6.ββ
β¦Musabβ© - 169 plays
β
7.βββ¦bunnieβ© - 168 plays
β
8.ββ
β¦izzy.β© - 160 plays
β
9.βββ¦patrickβ© - 127 plays
β
10.ββ¦Smugβ© - 124 plays
β
11.ββ
β¦Empridβ© - 116 plays
β
12.ββ
β¦bandit<3β© - 111 plays
β
13.ββ
β¦Xanβ© - 96 plays
β
14.ββ
β¦blinfβ© - 95 plays
**β
90.β
ββ¦fieryplace ππͺ΅π₯β©** - 5 plays
.u
β Cached playcounts have been updated for etstringy based on 64 new scrobbles.
5
Sorry, you are not added to this server yet. Run /refreshmembers and try again.
to owned jumpscare
LIE LIE LIE
wth
.w underscores
πββ
β¦angelβ© - 2624 plays
β
2.ββ
β¦Denβ© - 2400 plays
β
3.ββ
β¦slow descentβ© - 2197 plays
β
4.ββ
β¦seaβ© - 2140 plays
**β
5.**ββ
β¦maeβ© - 2011 plays
β
6.ββ
β¦leoβ© - 1948 plays
β
7.βββ¦kateβ© - 1833 plays
β
8.ββ
β¦arisβ© - 1463 plays
β
9.βββ¦CrosstownAceβ© - 1441 plays
β
10.ββ¦blahaj.zipβ© - 1163 plays
β
11.ββ
β¦vapβ© - 1024 plays
β
12.ββ
β¦Skyeβ© - 915 plays
β
13.ββ
β¦Seruβ© - 734 plays
β
14.ββ
β¦lazerβ© - 722 plays
Crown stolen by angel with 2624 plays!
Previous owner: slow descent with 2197 plays.
daamn
2023 soon
u can just ==
@sullen fiber FEMBOT LYING???
holy crap i will never listen to underscores again
my scrobbles for her is a power of 2
π€
πββ
β¦flag ββ© - 2696 plays
β
2.ββ
β¦leoβ© - 2478 plays
β
3.ββ
β¦slow descentβ© - 1551 plays
β
4.ββ
β¦Sharkyβ© - 1444 plays
β
5.ββ
β¦thejekky_brβ© - 1425 plays
β
6.ββ
β¦KingAssripperβ© - 1425 plays
β
7.βββ¦mΜ΅Μ₯ΝaΜ΅ΜΜΕΜΆΝ α»Μ·Μβ© - 1317 plays
β
8.ββ
β¦Slyβ© - 1229 plays
**β
9.**βββ¦maeβ© - 1227 plays
β
10.ββ¦jay !?β© - 1187 plays
β
11.ββ
β¦Vrayβ© - 988 plays
β
12.ββ
β¦funcβ© - 766 plays
β
13.ββ
β¦Nktekitβ© - 637 plays
β
14.ββ
β¦zipraβ© - 613 plays
idk actually
listen to underscores twice as much
.w crystal f
why he just there π

why he teeny π
simple actually
.w clarence clarity
πββ
β¦ornibswagβ© - 716 plays
β
2.ββ
β¦Meiyouβ© - 561 plays
β
3.ββ
β¦Κ kaestral Ιβ© - 285 plays
**β
4.**ββ
β¦vapβ© - 263 plays
β
5.ββ
β¦kohaiβ© - 227 plays
β
6.ββ
β¦arisβ© - 218 plays
β
7.βββ¦poisonβ© - 161 plays
β
8.ββ
β¦π Iris πβ© - 158 plays
β
9.βββ¦Harzoβ© - 109 plays
β
10.ββ¦Shigqat-chanβ© - 103 plays
β
11.ββ
β¦Keiraβ© - 92 plays
β
12.ββ
β¦relyqβ© - 76 plays
β
13.ββ
β¦leoβ© - 65 plays
β
14.ββ
β¦Migiβ© - 55 plays
.wk bladee
πββ
β¦shieβ© - 23725 plays
β
2.ββ
β¦wndyβ© - 19055 plays
β
3.ββ
β¦tβ© - 16587 plays
β
4.ββ
β¦sabian.β© - 14594 plays
β
5.ββ
β¦saint mothβ© - 13855 plays
β
6.ββ
β¦Implacityβ© - 13753 plays
β
7.βββ¦taroβ© - 12990 plays
β
8.ββ
β¦raineβ© - 12093 plays
β
9.βββ¦Goozmaβ© - 10747 plays
β
10.ββ¦tentaβ© - 10695 plays
β
11.ββ
β¦claymoreβ© - 10514 plays
β
12.ββ
β¦%?!β© - 10173 plays
β
13.ββ
β¦BoHaβ© - 9585 plays
β
14.ββ
β¦msyβ© - 8419 plays
**β
33.β
ββ¦fwjfiqwjiijqdqkdjodqadjioqw)β©** - 2726 plays
33
WHQT

i was lije 8
.w jane remover
wtf
πββ
β¦seaβ© - 7505 plays
β
2.ββ
β¦claymoreβ© - 2130 plays
β
3.ββ
β¦swimpβ© - 1857 plays
β
4.ββ
β¦Denβ© - 1179 plays
β
5.ββ
β¦geniβ© - 978 plays
β
6.ββ
β¦leoβ© - 941 plays
β
7.βββ¦dargyβ© - 759 plays
β
8.ββ
β¦tβ© - 539 plays
β
9.βββ¦Punchhyβ© - 505 plays
β
10.ββ¦arisβ© - 489 plays
β
11.ββ
β¦Creativezitoβ© - 403 plays
β
12.ββ
β¦vifeβ© - 400 plays
**β
13.**ββ
β¦vapβ© - 367 plays
β
14.ββ
β¦taroβ© - 341 plays
Crown stolen by sea with 7505 plays!
Previous owner: swimp with 1857 plays.
u need to up ur listenin
.w xaev
so many mentally ill people joined
πββ
β¦Aktimooseβ© - 4315 plays
**β
2.**ββ
β¦maeβ© - 1090 plays
β
3.ββ
β¦:3β© - 1005 plays
β
4.ββ
β¦Adonisβ© - 991 plays
β
5.ββ
β¦ren // rave // v2β© - 706 plays
β
6.ββ
β¦noduβ© - 615 plays
β
7.βββ¦justenβ© - 594 plays
β
8.ββ
β¦Marsβ© - 533 plays
β
9.βββ¦snowsey ββ© - 499 plays
β
10.ββ¦Meiyouβ© - 387 plays
β
11.ββ
β¦Jakeβ© - 382 plays
β
12.ββ
β¦infinite phantasmβ© - 373 plays
β
13.ββ
β¦junoβ© - 271 plays
β
14.ββ
β¦rqzβ© - 257 plays
Crown stolen by Aktimoose with 4315 plays!
Previous owner: :3 with 1005 plays.
godda,mn
imagine coming here to talk about a clever aoc solution then bam .wkamf
advent of code thread is new general
real
general for real mfs
any chat is general chat if you try hard enough
They can't moderate us all
i still dont know wtf a usize is
its the size of ur compilation target's pointers
u64 on 64 bit machines and u32 on 32 bit
IM CRACKED
@warped dust IM CRACKED
β‘(β(β‘0)(+): Β±-β[ββ].)
THIS SHIT FUCKED UP
INVERY ARRAY
im gonna look at this code in 2 hours and have no clue what it does
how
cus planet notation in array
WGAT IS INVERSE ARRAU
yop fire
inv vap
DNOOT
rini dumping vap,,
void goes to prison
what
join ".." .
alr what language we doing today
doubt
free parser
try inv join
i somehow made a hallucinating program that gives a different output each time
TRY SO STUPID
wooo
day two with both stars, no c boilerplate needed this time - can be compiled with nasm -f elf64 day_02.asm && gcc -Wall -no-pie day_02.o
I am not going to bother spoilering this xd
jeeez
hyperfine can't even time this accurately because it's too fast
how do u decide
when to use weirdly named registers
and when to use numbered ones
they're the same (mostly)
the numbered ones were added when CPUs changed to 64 bit
there are a few special case registers but mostly you can use whatever https://www.cs.uaf.edu/2017/fall/cs301/lecture/09_11_registers.html
flexing...
i just want to know how fast it is 
did u really learn asm
julia is so easy
teach me i wanted to learn

julia looks kinda fine
yes xP it's a required course at my uni and i think it's a lot of fun
its just js with end statements instead of brackets
and 1 based arrays
it seems kinda similar to ruby
yea actually tripped me up earlier xddd
also @ stuff kinda cool idk
real
secret weapon
rus
rust is cool but my brain is too small
(and for some reason rust-analyzer shits itself after two minutes and i have to restart vscode)

me but with typescript
i love β + shift + p restart ts server
funny looking x
ask
wish i could help but im struggling enough as it is lmao
im gonna try to do tmrw in zig
just finished day 2 yayyy
gj :3
no idea how go modules work but somehow managed to make a module with tests

go is cool i guess but my solution in julia was cooler cuz i can just put everything in one file
modules with "web addresses" like java or kotlin is so dumb, i dont get it
like in kotlin it just makes weirdly unnecessary directories
hop on hyperfine
much slower for day 2
well my program spends extra time doing stuff like fetching the input on each run
so hyperfine would have included the network request and stuff
rusting
bro is not
its fun overcomplicating an extremely simple thing ok
im a trans girl and i disapprove of your rust code. you should be ashamed
quit it even
never heard of .sum
let _ = π;
I don't give a shit if it flushes correctly
if it works then great
if it doesn't, it doesn't really need to panic or be handled Β―_(γ)_/Β―
damn julia benchmarking kinda goes hard
julia faster than rust??? can u believe it!
I also wasn't going for speed
neither was i
I was just curious how mine did
my solution garbage asf || ```julia
function two(in)
acc = 0
for line in split(in, "\n")
minRed = 0
minGreen = 0
minBlue = 0
for draw in split(split(line, ": ")[2], "; ")
for cubes in split(draw, ", ")
spl = split(cubes, " ")
num = parse(Int, spl[1])
if spl[2] == "red" && num > minRed
minRed = num
elseif spl[2] == "green" && num > minGreen
minGreen = num
elseif spl[2] == "blue" && num > minBlue
minBlue = num
end
end
end
acc += minRed * minGreen * minBlue
end
return acc
end
i search for uiua and a random ass .doc from a brazillian hospital titled "information for compulsory hospitalization" shows up
@sullen fiber you need that
@rotund moth
Thx
uiua users (vap)
sameee
but i used a hash...
instead of three vars
true
also i parse the game number
but it's not even needed cause it's just incremental...
yea
real
it doesn't even force you to split by ; technically
or split at all
you could just matchAll \d+ [rgb]
wonder whether its more performant to regexp than split
for my asm solution I just scan until I find a digit (that's not the game ID) parse the number then get the color by checking the first letter of the color
didn't end up doing any additional string allocation
if i get some free time tonight I want to update my ts solution to behave the same way and see how much time it shaves off
Nioyiii
Cracked
I didn't even finish that day
I must leave bed and do
forcing you to do compulsory hospitalization
Help
@sullen fiber are you feeling jolly yet
its absurd
Mommy and daddy are fighring
they are dragging it so much
I wanna go home
@warped dust I legit never thought about firmware
Firm
Soft hard

Alternating





oh thats smart actually
have fun besties ||474402212 214379527||
@warped dust OH MY GOD
I FINALLY DID PART 1 IN UIUA https://adventofcode.com/2019/day/3
||i tried doing the canvas strategy like u saw but then on the real puzzle it would be like a 20000x20000 matrix of float64s||
||so i ended up just using cross on the line segments||
you dont have to use java packages
you can just put everything in fun main() if u want to
part1 20,299ms part2 20,570ms
what abt u
you used a lot of string splits right
yes its like 99% that
might be string splits + struct initalization
i'll get my aoc repo updated sometime later today probably
but in the meantime
bleh
shidded
i think i might be able to optimize more if i used substrings instead of splitting
lemme try
oop
yeah my ide likes doing that and I can't be bothered to find the setting to turn it of xd sorry
meh?
that's not too bad
yeah julia is quite performant
trailing newline is good if you dont use trailing newlines you are evil
skill issue
using my cheaty solution 
language issue actually
reading line by line shouldnt make the trailing newline return ""
writing this in assembly is going to make me go insane i am already thinking in x86 instructions
Save Without Formatting
love
wdym, if i split by \n, i expect empty string if it has trailing nl
i have decided i will not optimize my shit
i think its def to do with initializing structs and/or strings
light memory usage :3
LITERALLY HOW
how the fuck
fucking finland
mine used like 300mb max
guys im gonna time my javascript solution
no thats just total alloc, i dont think it counts dealloc
o
get real
javascript is faster than assembly confirmed
this is why our operating systems should be written in javascript
idk how my shit is going so slow like i know its not optimized but 20s?? π
its only like ~450mb in the REPL while benchmarking
repl itsel already isnt small
sure :3
`using Test
@testset "works for example input" begin
input = read("example.txt", String)
@test one(input) == 8
@test two(input) == 2286
end
input = read("input.txt", String)
@info "Part one: $(one(input))"
@info "Part two: $(two(input))"
`
oh
is urs bigger?
i meant this large input xd
100k games, that's what we've been benchmarking against xP
yummy memory
When leaderboard in the discord
L:MAO WTf
oh whatt
did u generate ur own input
I did yeah
I haven't found someone who's providing large inputs for this year like they did last year so I made my own for today
ok bet imma try it on julia
im gonna try making it faster in uiua
you actually prob can
issue is i read the entire thing then do everything at oncd
yea def
yeah you can speed things up a lot if you use a scanning +incremental approach rather than full out parsing
uiua has nice readuntil i think
best readuntil
; skips characters in the input until the character given in parameter_byte is found
skip_until_char_loop:
inc index
skip_until_char:
cmp current_char, parameter_byte
jne skip_until_char_loop
ret
if nasm didn't have %defines so I could add names for registers i think i would explode
Unfortunately not 
use splitn
or just
let first = game_number.next().unwrap();
if you're sure it will always exist (unwrap will panic if it's null)
just do one of the things I gave u
true do vee
smal improvements 
Pro tip im learning in rust AoC: error handling is for nerds
I mean yeah error handling is useless in aoc cause your input is consistent
no edge cases so you can just unwrap everything xd

I might switch to using ? though because it's easier to type
Anyways yeah a Split type is just a fancy iterator
So literally any method of grabbing entries out of an iterator will work
hop on split_once
split once thats what i wasthinking of
or be sane and do this
.next() 1
.next() 2
ty shut up
ok
let (num, string) = line.split_once(": ").unwrap()
yea that
i thought split n was an option slice
death
dude i will prob have an easier time making my uiua faster than my damn julia
yop but rust is unusable without r-a
i wonder
has anyone tried rust rover from the silly brain company
its horrible
or does it eval when u use it
it does
i had the &ru \0 0 on a var
and then did it again to test
input was already empty
u did it twice and it ran it twice?
ya
oh so it doesnt store
its like a macro
L = S @\n &ru \0 0
<something something> &ru \0 0
and it wasnt doing anything
bc L took all the input
oh
REAL
REAL
i bet it checks the function signature
and caches the value if its 0.0
0.0
0.0
stack empty when reaching for argument 2
why rust no javascript
Yes
You don't need parentheses for rust ifs
Which means you need to differentiate between the conditions and the blocks somehow
yes theres only one way to write ifs
if a == b println!("me when")
@sullen fiber did day 2 now, what does yours look like?
ADB.EXE JUMPSCARE
i didnt use regex
cus cheating
also regex is gonna be real soon
new pr that adds real capture group
i didn't want to regex but the alternative i thought up is so bad
rate mine
please tell me you didn't actually develop it like that
I did
okay initially it had one func
it ate all my memory then caused my computer to freeze and i had to forcefully reboot
LMAO
most memory efficient uiua program 
except it didnt freeze it killed after a few seconds
i really like how this works for grouping the various counts into an array
i did ||* find :"rgb" with the first letter and the count on stack||
gonna kill the regex now because that really is not nice
i wanna revise mine to make it more efficient and maybe shorter
oh wait gimme the bigboy i wanna see how badly my machine explodes with it
e
hop
slow
btw you love that my answer used to have a raw null byte in it
LOL
she literally put @<actual nul byte> in her code
kill
what does that do
i was forced to remove it
i am about to oom
kasi you shouldnt be talking about these things publicly like that
damn i forgot advent of code was a thing until today
yea tjos os real
thjis ris real
hihi
remember that the cubes are put back in the bag after each draw - ||you're looking for the max of each color drawn, not the sum||
I made two :)
you love @warped dust

elixir is actually nice i think?
more pleasant than whatever the fuck purescript was
i love beam languages they're all deranged in their own way
so fast
you will do threading
thread u on a uhm
I may be late to advent of code because hbomberguy new video.
man in cave is something internet historian blatently plagerized from someone else
pleh my zig solution is so cursed
im using 4 nested iterators to read from a stream ._.
Nooooooo I'm not going to be home for AoC
I really hope day 3 isn't gonna have me do recursion lol
Recursion is so fun though
wow nice parsing time
jesus christ this one seems annoying
Yeah
Thinking of how to seperate the number groups
hmm seems easy enough actually
just annoying
INSANE
yeah
this one is killing me
sike
okay i will do it in erlang
lmao the erlang lsp
is made by whatsapp
this one is kinda hell in switft
@warped dust @warped dust @warped dust @warped dust @warped dust @warped dust @warped dust @warped dust @warped dust @warped dust @warped dust @warped dust @warped dust @warped dust @warped dust @warped dust
the rini rot
I think this one is gonna take a while
JESUS
rinninininini
zt
hi
i cant even figure out how i should seperate the shit this fucking sucks
like idk
bruh this one fucking killed aoc for me this one seems so annoying
I think I'm gonna have to whiteboard this for a bit
why was day 1 so hard, day 2 so easy, day 3 fucking hell
i was about to say "did you already fuckin finish it in assembly"
@sullen fiber today is kinda fire for uiua tbh
i know i can do it but its all so unpretty
advent of code in a nutshell
||cant wait to run katlyn's large input on gpu||
i will nuke rini
my assembly solutions so far have taken a while to write
an hour and a half for the first and probably six hours for the second day
I could do today in assembly but i'd have to do pointer math and that kind of stuff in assembly which. I don't really want to do.
sounds fun
true
2> lists:map(fun(X) -> case X of "." -> 0; _ -> 1 end end, "...*..").
[1,1,1,1,1,1]
rate
where's the leaderboard channel
end end
I am going to sleep
how the fuck do Zain and katlyn always finish before me
Part one: 6ms
Part two: 5ms
=<
WTF
yes.
?#$@
what the fuck
=<
= angry face =< sad face
@neon ore hi
hihi
sunni
I should turn mine into a function so I can run it 293487892374 times and get an average
yeah that one is an outlier
everything else i get with the one offs is slower

same
same
i have already peeled off my skin
π
=/=
Advent of code really is making me write the dumbest possible rust code possible
it works but only after I tweaked it a ton of times hoping it fixed itself
at least this one is easy to visualize for debugging
oh my god im
do I know how my code works? barely
actually braindead
does it work? yes
erlanging all over the place
OMFGGGGGGGGGGGGGGGGGG
I HATE
range inclusive comes to bite me AGAIN
kill rust
i keep forgetting that .. does not mean ..=
im done
yep
that annoyed me a few times too
and then I had the whole deal of trying to conceptualize "2nd character" vs "1th index" and how the hell ranges work on top of all of that
plus the deal with regex ranges inclusivity because I used regex to extract all numbers (im lazy ok)
....
I'm so happy for you (what the hell is that supposed to mean)
language of the deranged
horror
override fun solvePart1(input: File): Int {
val grid = Grid.of(input.rl())
return grid.filterConsecutive { it.toString().matches("[^0-9.]".toRegex()) }.mapIndexed { point, _ -> point.getNeighbors().mapNotNull { grid.numberAt(it) }.distinct() }.flatten().sumOf { it.toInt() }
}
override fun solvePart2(input: File): Any {
val grid = Grid.of(input.rl())
return grid.filter { it == '*' }.mapIndexed { point, _ -> point.getNeighbors().mapNotNull { grid.numberAt(it)?.toIntOrNull() }.distinct().let { if (it.size == 2) it.product() else 0 } }.sum()
}
Day 3 in one line (i had to cache the grid parsing to make it 300ms instead of 7 seconds because if i dont, itll parse the grid every time it wants to know a number
(i basically outsourced everything into utils but 1 line is 1 line)
what does ur pfp say
close enough i guess
@sullen fiber fix my code
its also the saudi arabia flag and the hamas flag and the isis flag i guess
you should maybe change it if u don't wanna be banned
if i get banned for having the declaration of faith as my pfp so be it
it has nothing to do with terrorism
The Shahada (Arabic: Ψ§ΩΨ΄ΩΩΩΩΨ§Ψ―ΩΨ©Ω aΕ‘-Ε‘ahΔdatu; Arabic pronunciation: [aΚΚahaΛdatΚ], "the testimony"), also transliterated as Shahadah, is an Islamic oath and creed, and one of the Five Pillars of Islam and part of the Adhan. It reads: "I bear witness that there is no deity but God, and I bear witness that Muhammad is the Messenger of God."
The S...
why is it threatening me
check top or else youll check mid
true
is this erlang wtf.
yes
who tf decided to do orelse and not "or" or "||"
fix it orelse..
because or is already a thing
but it doesnt short-circuit
or as a binary operation?
so if u use or its gonna be slower or what
yeah cuz it can stop at first row it finds
i have no idea why they didnt just make or always short-circuit
i thought it was alhamdulillah for a second
its a bit too long to be that
too many damn word
yeah
erlang is so funny
well if you can do x = 1 or 2 and make it return 3 then it makes sense cuz its not supposed to be used for boolean comparison
but then just do it like everyone else with | and || or make it check if its evaluating an expression and base it off that so you can have the same keyword do 2 things
you terminate statements with periods, join expressions with commas, and related statements need semis
or make | the bitwise or and or the short circuit boolean or
wow this is so english
true
any language that does not terminate statements with line breaks should be deleted from existence
if you want 2 on 1 line use semicolons but dont force semicolons
i see. your previous message made it seem like you had it as pfp as a symbol of those groups
if that's not the case then that's fine
did you do part 1 by the numbers or by the symbols
or are u still awake
still awake
nums
F
GO SLEEP GIRLIE
I MUST ERLANG
tbh its not that hard to redo it by symbols, i also did it my numbers in pt1
@warped dust Sleep girlie
alexandria ocasio cortez can wait can wait...
rate
@tranquil vapor do AOC in powershell
if you do symbols in p1 you have to check for duplicates without taking it out the same number in different positions
rate
I did last year
Alhamdulillah
should i do this year only with oneliners
NOT AGAIN
hop off code burger
read @steady fog
you will learn powershell
venshell
@real hinge you are rusty
yes
wait this isnt supposed to work
no that's github
looking forward to day 25 in erlang because you ran out of normal languages
@steady fog this is you
do one -> o1e
two -> t2o etc
THIS IS ME
why would u do the easiest day in python
I WASTED SO MUCH TIME

UNTIL I REALISED
YOP
just do example first π
THAT WASNT EASY
? ? ? ? ?? ?? ?? ?
girlie the example didn't have any relevant overlaps
it did...
@high lintel hey girl
yes it did
my code worked on the example then exploded on the actual thing
it didnt as far as I remember
oh yeah maybe if the only number is eightwo
it didnt have that
maybe they updated later
except this overlap doesn't matter
yea but it doesnt include the case of just something liek twone being 21 and not 2ne
yea ig
it doesnt matter if two disappears
yeah what manti said
day 1 should be any langugae that has .replace
it only causes issues if the overlap is at the end
not python
true regex is kinda cheating
mine didn't work cuz i used replace so i knew from example
I wouldnt consider it tbh
it would be hella painful otherwise
me when 30000 .splits
not even
you didn't even have to
no I am not talking about day1
good
I didnt use regex on day1
regex so bad
you could literally just
line.matchAll(/\d+ [rgb]/g)
but on day 2 its kinda needed
yea there were a bunch of splits in day2 but it really isn't that big of a deal to use regex imo
if you are using some language like python or js its not really big deal yea
but I can imagine it being painful on rust and other low level languages
you could do day 1 with a for loop
amazing
check index of 1-9 and one-nine and see which one has the lowest and highest index
won't even get overlap issues with that
okay I take my word
@tranquil vapor do part2 for me
I just did find and rfind
then put all found elements to some vector
ordered and did the thing
manti u will do aoc in ruby
too late
I was gonna do Ruby today
I decided to use rust
but I couldn't get lsp working
same
@tranquil vapor @tranquil vapor@tranquil vapor I used go today
GOOD
it feels weird to see functions without parantheses
but other than that good 
ruby can be so insane i fear sofia's ruby
insanity https://codeberg.org/rini/aoc/src/commit/282429aa7079a18d1076cafea1c06f9df6db9ea0/day01/pt2.rb
who
:33333
@warped dust sofa
no..
you can still use them in ruby

love
ruby is python2
lisp so bad
instead of ```rb
File.foreach file do |line|
end
```rb
File.forEach(file) { |line|
}
``` or ```rb
File.foreach(file) do |line|
end
I haven't done
do
part 2
yop
manti will explode when day two done without splits https://github.com/katlyn/aoc/blob/2023/day_02/asm/day_02.asm

what the hell
why assembly
do you hate yourself
it's fun :3
@proper totem hi
hewos @steady fog @steady fog @steady fog

:spoob:
spoob
FINALLY
WHAT
2/10
maaaaaaaaaaad
i didnt look
ur so mean
even in swift this shouldnt be too hard no?
dont need to do a lot of string manipulation
||
function one(input)
acc = 0
nextToSymbol = Set{Tuple{Int,Int}}()
lines = split(input, "\n")
for i in eachindex(lines)
for j in eachindex(lines[i])
char = lines[i][j]
if char == '.' |fucking hell so bad why do i have to do this| (char >= '0' && char <= '9')
continue
end
push!(nextToSymbol, (i, j + 1), (i + 1, j + 1), (i + 1, j), (i + 1, j - 1), (i, j - 1), (i - 1, j - 1), (i - 1, j), (i - 1, j + 1))
end
end
for i in eachindex(lines)
num = ""
isPart = false
for j in eachindex(lines[i])
char = lines[i][j]
if char >= '0' && char <= '9'
if ((i, j) in nextToSymbol)
isPart = true
end
num *= char
else
if isPart && length(num) > 0
acc += parse(Int, num)
isPart = false
end
num = ""
end
end
if isPart && length(num) > 0
acc += parse(Int, num)
isPart = false
end
num = ""
end
return acc
end
``` ||

@elfin umbra
new vpak
gondola lift time
dude
ruby extension broke
its so over
it has some stale dir saved
ruby_lsp_2023
where is it pulling that from
ohhh
its borked
File.write("C:\Users\Banana\stuff")
it doesnt double escape
so it becomes File.write("C:UsersBananastuff")
windows
what ruby lsp are you using none of them worked for me
shopify
so bad
terrible
its really bad its essentially worthless
no autocomplete
i dont remember it being bad
OH MY GOD
ITS JUST BROKEN EVEN ON LINUX
DOGSHIT
WHAT IS THAT DIRECTORY
WHY ~/bin
RUBY
HOLY SHIT @warped dust
but it still sucks
how do you feel knowing erlang has better lsps than ruby
Extension for Visual Studio Code - A Ruby language server featuring code completion, intellisense, and inline documentation
this is decent
the shopify one is hot garbage
this makes syntax highlighting better
windows
ruby


