Python, 92 characters
To avoid spoilers, I'm just going to provide this shell snippet:
>>> import hashlib; hashlib.sha256(code).hexdigest()
'60fa293bbe895f752dfe208b7b9e56cae4b0c8e4cdf7c5cf82bf7bab60af3db6'
>>> exec code
d9a6b63356a7954b29b0ac7f2aaa6d19b84b4cf8b62aac95a14b4ea59db3e7c94c4959ec94...
I hope this does not become the norm.
Would be fun if he was a troll getting 120 rep for free :P
got my toy apl to do a matrix product 86400 3600 60 1+..0 2 1 18 => 7278 .
The first dot is "dot-product", the second dot is "product".
I thought about making "power" an operator instead of a function, but it got too weird to think about.
or never got weird enough, maybe.
In order to do "base" and "encode" like the APL book describes, I'll need to generate a triangular matrix. And probably a whole prototype matrix family.
So I'm thinking that'll be a dyadic operator, similar to the circle functions, and maybe I can do rotation/transposition the same way.
And at some point, I'll want to extend it to handle floating-point numbers and character strings.
With strings, it can invoke execute as a function, and then variables can hold code.
Unfortunately, I can't use "dot" as a floating-point notation if it's overloaded already as a function and an operator. :(
John Tenniel's Illustration for Alice in Wonderland portraying Alice attempting to play Croquet with a flamingo and two hedgehogs.
http://www.gutenberg.org/files/114/114-h/114-h.htm#alice30
Perhaps with "x=x+1" on the hedgehog running away and "++x" on the one underfoot.
For code-golf types, usually there isn't a time limit anyway (from what I've seen). I don't think removing it will be frowned upon. Accept whichever one is winning. You can always accept a different one later if one comes along and beats it.
Awesome, @Doorknob. The fifth one unfortunately broke my streak. I haven't posted another one since. I am a broken man. Otherwise, I would spark a competition with you for longest nice question streak.
The debate in the comments about the complexity of the algorithm required to solve it has nothing to do with the CHALLENGE. It should be reopened because the challenge is a good one.
@Rusher Intention. OP clearly isn't interested in hosting a contest. IMO it's not worth trying to "fix" these off-topic questions: if you think there's a decent challenge there then rather than trying to reopen the question, vote to delete it and then post a question which sets out from the start to be a contest.
@PeterTaylor Some have mentioned that questions are better if they are polished by the community. Are you now claiming that the intentions of the original poster are what really matters, and not the efforts of the community?
You had better cast your close vote on the question as it stands, not on the question as it was.
I guess we'll see. I won't advise editing it again just for the sake of wikifying it. The OP gave me an idea, though. Is algorithm complexity a potential "winning criteria"?
I mean, if I identify the critical operation, it would be trivial to calculate the complexity of any algorithm that involves the critical operation right?
I think it's a very neat idea: algorithmic complexity.
I was saying that identifying the critical operation makes the challenge "possible". Without such identification, any two difference counts would be irreconcilable.
Well, in the same way that answers should be trivially proven correct before counting characters for code-golf, it should be trivial to calculate the complexity. Otherwise, scoring such a contest would be a nightmare
@Rusher But we're not talking here about polishing: we're talking about wholesale change.
@Rusher Not just the time of posting. I don't see any evidence that OP has understood what this site is about. For what he wants, he's better served by StackOverflow or CS. For what we want, we're better served (in general) by OPs who understand what the site is about.
@Rusher It's been tried, but not very often. It proves problematic: there are potential issues with knowing the complexity of functions provided by the library, and with getting n-way ties between all of the answers.
@Rusher (FWIW: I cast a close vote on the question as it was, so I can't cast another. But as it stands, it's a trivial problem dressed up as pop-contest, so I would prefer it remain closed).
@PeterTaylor I didn't realize that "OP does not understand what the site is about." was a valid close reason. Is it generally frowned upon to create new close reasons on the fly, or is there a certain rep threshold where people don't question you about such things?
@Rusher The close reason is "Off topic". When what the OP wants is clearly better served by another stack then the correct thing to do is not to try to force them into being the host of a contest: close their question, flag for migration, and if there's a nugget there which can be recast into a suitable form then do that as a new question rather than trying to pervert the OP's intention.
John Tenniel's Illustration for Alice in Wonderland portraying Alice attempting to play Croquet with a flamingo and two hedgehogs.
http://www.gutenberg.org/files/114/114-h/114-h.htm#alice30
Perhaps with "x=x+1" on the hedgehog running away and "++x" on the one underfoot.
