The existing factorial challenge has some restrictions on the domain, performance, and banning built-ins. I opened a meta question about it a week ago, and as per the meta consensus, we decided to post a new vanilla factorial challenge. The sandboxed challenge is here.
Now the problem is: Should we close the old factorial challenge as a dupe of the new one?
As Luis Mendo requested in the comment, here is a copy of my statement for voting.
I believe it is not a dupe because the solutions to the existing challenge are not likely to be competitive here, and solutions to this one are not likely to be valid on the other.
Using Mego's post as the guideline, in my opinion:
Is the "meat" of the challenges the same? Not really. The restriction imposed on the old challenge is so hard for languages without infinite-precision integer support, making the "restriction" the core part of the challenge, rather than the factorial-calculating part.
Could answers from one be posted to the other, with trivial modifications at most, and be competitive? No, based on the quote above.
Which challenge is better? This part is irrelevant since it is about which to leave open assuming they are dupes of each other, and I don't think they are dupes.
This challenge is in a very similar situation and it is closed as duplicate.
The only reason we use the old challenge is, it is a factorial challenge.
Now that we have the new challenge, what does the old one do?
