We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The idea here is to store every integer digit as an array of 8 bits. Was ist mein Aszendent? Then multiply it manually to find the factorial. While multiplying needs summation, so we need summation manually.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Extra Long Factorials
You are viewing a single comment's thread. Return to all comments →
The idea here is to store every integer digit as an array of 8 bits. Was ist mein Aszendent? Then multiply it manually to find the factorial. While multiplying needs summation, so we need summation manually.