Hello everyone!

We're glad to present you alpha-version of FastComputing. FastComputing is an endless competition in writing most effective code. You are given well-known problem (multiplying of two matrices for example), but limitations are such, that it's impossible to solve these problems without serious optimization (for example, you're to multiply matrices of sizes as big as 5000). Of course faster are your programs — bigger is your rating. If you're interested — welcome to fastcomputing.org This project is in alpha-version state. It means, that most of the stuff is working, but something can eventually broke, doesn't work or work slow. If you encounter something like that, please report to project authors.

There are not so much problems, but we will add more problems with time and will try to add problems from different computer science topics.

Also we have a rating system. Our formula now is temporary, we will change it in future (when we will have more participants and will be able to check different formulas on real data).

UPD: Our system has a glitch — it reports Idleness Limit as Time Limit (we will fix that, but not too fast). You can note that seeing that reported used time is 5 times more than time limit from the statement. Please note, that input and output in all problems is into files, not into stdin/stdout.

UPD: We added one more problem (modular inverse of a matrix). Also test number is now shown as usual. Fixed glitch with idleness limit.