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 03:50e1011e1011Score: 22,943Success
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 03:5022,9023,446,283,9963,418,926,00016,463,00016,793,600
2Oct 21, 2026 03:5022,9193,448,777,1193,421,296,00016,687,00016,793,600
3Oct 21, 2026 03:5022,9353,451,148,5483,423,808,00016,522,00016,793,600
4Oct 21, 2026 03:5022,9353,451,155,0123,423,630,00016,628,00016,793,600
5Oct 21, 2026 03:5022,9433,452,586,5863,424,757,00016,716,00016,793,600
6Oct 21, 2026 03:5022,9713,457,065,7573,429,332,00016,460,00016,793,600
7Oct 21, 2026 03:5022,9753,457,453,9913,429,695,00016,702,00016,793,600
8Oct 21, 2026 03:5022,9973,460,610,5083,433,032,00016,630,00016,793,600
9Oct 21, 2026 03:5023,0123,462,953,7213,435,014,00016,852,00016,793,600