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 listJul 29, 2026 16:34anboto1anboto1Score: 2,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 16:352,798429,575,138405,126,00014,607,00016,793,600
2Jul 29, 2026 16:352,799430,040,586405,461,00014,526,00016,793,600
3Jul 29, 2026 16:352,800430,225,004405,492,00014,628,00016,793,600
4Jul 29, 2026 16:352,801430,250,742405,782,00014,456,00016,793,600
5Jul 29, 2026 16:352,802430,398,945405,621,00014,680,00016,793,600
6Jul 29, 2026 16:352,803430,725,866406,031,00014,538,00016,793,600
7Jul 29, 2026 16:352,803430,544,212405,864,00014,627,00016,793,600
8Jul 29, 2026 16:352,804430,535,301406,047,00014,559,00016,793,600
9Jul 29, 2026 16:352,847447,631,378412,560,00014,629,00016,793,600