Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listOct 21, 2026 05:53e1011e1011Score: 5,781Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 05:545,694865,046,618838,194,00016,007,00016,793,600
2Oct 21, 2026 05:545,743872,525,920845,248,00016,344,00016,793,600
3Oct 21, 2026 05:545,760875,085,082847,652,00016,487,00016,793,600
4Oct 21, 2026 05:545,764875,521,508848,404,00016,286,00016,793,600
5Oct 21, 2026 05:545,781878,081,491851,176,00016,041,00016,793,600
6Oct 21, 2026 05:545,802881,259,846854,062,00016,346,00016,793,600
7Oct 21, 2026 05:545,803881,477,034854,179,00016,412,00016,793,600
8Oct 21, 2026 05:545,804881,473,359854,462,00016,212,00016,793,600
9Oct 21, 2026 05:545,806881,814,272854,531,00016,427,00016,793,600