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:16anboto1anboto1Score: 3,372Success
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:163,350512,566,310464,442,00038,185,00016,793,600
2Jul 29, 2026 16:163,351512,837,733464,684,00038,038,00016,793,600
3Jul 29, 2026 16:163,361514,171,276464,932,00039,253,00016,793,600
4Jul 29, 2026 16:163,369515,470,935466,775,00038,609,00016,793,600
5Jul 29, 2026 16:163,372516,332,914466,584,00039,315,00016,793,600
6Jul 29, 2026 16:163,377516,612,979468,329,00038,224,00016,793,600
7Jul 29, 2026 16:163,387517,948,212469,702,00038,362,00016,793,600
8Jul 29, 2026 16:163,391518,718,320469,825,00038,855,00016,793,600
9Jul 29, 2026 16:163,409521,466,099473,046,00038,412,00016,793,600