http://git.tuvimen.i2p/aoc2024/tree/17/sol2.c
= NULL ); size_t inputl ; char * input = readinput ( delim + 2 , & inputl ); fclose ( f ); ull start = ( ull ) 1 << (( 3 * ( inputl -1 ))), end = (( ull ) 1 << (( 3 * ( inputl )))) -1 ; ull step ; size_t i = inputl -1 ; while ( 1 ) { step = ( ull ) 1 << ( i * 3 ); for ( size_t j = 0 ; j < 8 && start < end ; j ++ ) { runprogram ( input , inputl , start , rB , rC ); assert ( inputl == outputl ); if ( output [ i ] == input [ i ]) { if ( start + step < end )...