2022-01 in befunge!

2022/01/example

@@ -12,3 +12,4 @@
 9000
 
 10000
+

2022/01/first.b98

@@ -0,0 +1,7 @@
+00p10p;max in 0,0, current total in 1,0;v
+>#;~:a-#v_$v@,a.g00; parses a number    >
+^+*a\-0'<  : if not an empty line, add to total and read another number
+^   p01+g01_v
+^  vp00<    >1v
+^  >v $wg00:g0<
+^p01< $<

2022/01/second.b98

@@ -0,0 +1,8 @@
+00p10p20p30p                                 v
+current total in 0,0 top3 in 1,0 2,0 and 3,0
+>#;~:a-#v_$v@,a.++g03g02g01 ;                >
+^+*a\-0'<  : if not an empty line, add to total and read another number
+^   p00+g00_v      >10g00g10p00pv      >20g00g20p00pv      >00g30pv
+^  vp01<    >10g00gw>           >20g00gw            >30g00gw      >00p
+                   >            ^      >            ^      >      ^
+

README.md

@@ -2,4 +2,7 @@ This repository contains my solutions to the advent of code puzzles available at
 
 I do not strive for elegance or anything, I just solve a puzzle (often brute forcing it) and if it executes fast enough I move on to the next one.
 
-If the puzzle suits my fancy I implement a [Funge-98](https://github.com/catseye/Funge-98/blob/master/doc/funge98.markdown) solution for fun that I run using my own interpreter [gofunge98](https://git.adyxax.org/adyxax/gofunge98).
+If the puzzle suits my fancy I implement a [Funge-98](https://github.com/catseye/Funge-98/blob/master/doc/funge98.markdown) solution for fun that I run using one of my own interpreters:
+- [gofunge98](https://git.adyxax.org/adyxax/gofunge98).
+- [nimfunge98](https://git.adyxax.org/adyxax/nimfunge98).
+- [zigfunge98](https://git.adyxax.org/adyxax/zigfunge98).