part 1, I used Perl for fun 
enjoy!
#!/usr/bin/env perl -lnp
$l=y///c/2;s!.{$l}!$'=~/[$&]/;$&!e;$\+=-(ord>96?96:38)+ord}{
part 2:
priorities=[?a..?z, ?A..?Z] |> Enum.concat() |> Enum.with_index(1) |> Map.new()
File.read!("input")
|> String.split("\n")
|> Enum.map(& String.to_charlist(&1) |> MapSet.new())
|> Enum.chunk_every(3)
|> Enum.flat_map(fn g -> Enum.reduce(g, &MapSet.intersection/2) end)
|> Enum.map(&priorities[&1])
|> Enum.sum()
|> IO.inspect()
Yes! It’s a classic trick for Perl golf-ing. Challenge: can you find where it comes from? ( hint, it’s linked to the -p option)
Like some other people in this thread, I also went with code points to calculate the item priorities, but I took an exotic approach with List.myers_difference/2 for part 1. Before getting to part 2, I didn’t even know that MapSet exists.. 
. Oh well, like in the previous days, I’m always happy to get feedback. It’s a great help to improve as I’m starting with Elixir.
https://github.com/dmarcoux/advent_of_code_2022/blob/main/lib/advent_of_code2022/day3.ex
I got the same feeling as you, but let’s take this as a learning opportunity 
. I also took myers_difference, but from List.myers_difference/2. I didn’t even know it was in String.
