qmacro · December 2, 2022 14:26
diff --git a/solution.jq b/solution.jq
 #!/usr/bin/env jq

 # Run with:
 # -R (read raw strings, not JSON texts)
 # -s (slurp all inputs into an array)
 # i.e. jq -f solution.jq -R -s input.dat

 # When initially read in, the input will look like this:
 # "1000\n2000\n3000\n\n4000\n\n5000\n6000\n\n7000\n8000\n9000\n\n10000\n"

 # Marshall the input into an array of arrays of numbers
 # - chop of last newline (so the split won't end up with a last empty value)
 # - split on blank lines
 # - split on newlines and convert values to numbers
 def getinput:
  sub("\n$";"")
  | split("\n\n")
  | map(split("\n")|map(tonumber))
  ;

 def part1:
  map(add) | max;

 def part2:
  map(add) | sort[-3:] | add;

 getinput as $input
 | [
    ($input | part1),
    ($input | part2)
  ]
	#!/usr/bin/env jq

	# Run with:
	# -R (read raw strings, not JSON texts)
	# -s (slurp all inputs into an array)
	# i.e. jq -f solution.jq -R -s input.dat

	# When initially read in, the input will look like this:
	# "1000\n2000\n3000\n\n4000\n\n5000\n6000\n\n7000\n8000\n9000\n\n10000\n"

	# Marshall the input into an array of arrays of numbers
	# - chop of last newline (so the split won't end up with a last empty value)
	# - split on blank lines
	# - split on newlines and convert values to numbers
	def getinput:
	sub("\n$";"")
	\| split("\n\n")
	\| map(split("\n")\|map(tonumber))
	;

	def part1:
	map(add) \| max;

	def part2:
	map(add) \| sort[-3:] \| add;

	getinput as $input
	\| [
	($input \| part1),
	($input \| part2)
	]