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 9, 2026 10:18Karthik ReddyKarthik ReddyScore: 1,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 10:261,558242,809,383229,579,0004,230,00016,793,600
2Oct 9, 2026 10:261,558242,838,247229,572,0004,252,00016,793,600
3Oct 9, 2026 10:261,559242,997,253229,662,0004,249,00016,793,600
4Oct 9, 2026 10:261,559243,064,986229,615,0004,240,00016,793,600
5Oct 9, 2026 10:261,559242,746,090229,655,0004,248,00016,793,600
6Oct 9, 2026 10:261,560243,040,478229,802,0004,260,00016,793,600
7Oct 9, 2026 10:261,561243,181,185228,833,0005,332,00016,793,600
8Oct 9, 2026 10:261,562243,410,877230,110,0004,289,00016,793,600
9Oct 9, 2026 10:261,571245,030,535231,514,0004,260,00016,793,600