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 08:48Karthik ReddyKarthik ReddyScore: 1,561Success
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 09:501,560243,102,448229,124,0004,984,00016,793,600
2Oct 9, 2026 09:501,560243,045,753229,808,0004,220,00016,793,600
3Oct 9, 2026 09:501,560243,093,112229,927,0004,214,00016,793,600
4Oct 9, 2026 09:501,561243,187,212230,011,0004,247,00016,793,600
5Oct 9, 2026 09:501,561243,269,829230,077,0004,215,00016,793,600
6Oct 9, 2026 09:501,561243,203,693229,918,0004,258,00016,793,600
7Oct 9, 2026 09:501,562243,246,135230,020,0004,281,00016,793,600
8Oct 9, 2026 09:501,562243,363,252230,179,0004,199,00016,793,600
9Oct 9, 2026 09:501,568244,390,723231,090,0004,221,00016,793,600