codegolf.stackexchange.com/questions/255135/… wonder how short this can go in APL

I have 26

21 now (including 0, :( )

@xpqz some time ago there was chat about how to be able to get problem input directly without copying request headers from the browser interface into a text file, do you remember what that was?

@RikedyP I recall the conversation, but not if there was a conclusion. I guess it’s not impossible to write something that uses the google/github auth APIs, but for the few seconds it takes to copypasta the competition data set from the browser into a textfile, it seems like diminishing returns.

@xpqz fair enough, I'll stick with what I've got then

@RikedyP See: github.com/wimglenn/advent-of-code-data -- looks like they've written a way to scrape the token automatically.

Day 3

{(⍳52)+.×+/((⎕C⎕A),⎕A)∘.=⍵}{⍵(⊃↓∩↑)⍨2÷⍨≢⍵}¨⊃⎕nget 'input.txt' 1

{(⍳52)+.×+/((⎕C⎕A),⎕A)∘.=⍵}{⊃⊃∩/⍵}¨↓100 3⍴⊃⎕nget 'inut.txt' 1

part 2

would it be nice if +/ 3¨⍳9 gives (1+2+3)(4+5+6)(7+8+9)? Or is ↓3 3 ⍴ ⍳9 the best way to group it in parts of 3?

I had:

d←⊃⎕NGET'd/3'1⋄l←∊(⎕C⎕A)⎕A⋄f←{∪⊃∩/⍵}
+⌿l⍳∊{f↓2(2÷⍨≢⍵)⍴⍵}¨d ⍝ part 1
+⌿l⍳∊f¨↓(3÷⍨≢d)3⍴d    ⍝ part 2

@xpqz using index is smarter than my outer-inner product combo

@Richard Indeed. I was too rushed there.

lol I didn't realize there is ∩

:) How did you solve it?

by {∪(⍺∊⍵)/⍺}

otherwise pretty same idea to xpqz's answer