From: krishna.myneni@ccreweb.org   
      
   On 5/4/24 12:42, Anton Ertl wrote:   
   > Krishna Myneni  writes:   
   >> Nice. However, it's probably not a practical way to do arithmetic of big   
   >> numbers, compared to adding binary representations of the number in   
   >> larger chunks than single decimal digits.   
   >   
   > In the Euler 13 case, each input number is used only once, and as I   
   > explained in <2024May3.102927@mips.complang.tuwien.ac.at>, converting   
   > an input number to a binary representation costs more than adding it   
   > digit-by-digit (i.e., column by column), which my program from that   
   > posting does.   
   >   
      
      
   Thanks, I'll try it.   
      
   --   
   KM   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)