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 11:38Karthik 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 12:001,559242,408,243229,664,0004,249,00016,793,600
2Oct 9, 2026 12:001,559242,571,104229,635,0004,249,00016,793,600
3Oct 9, 2026 12:001,560242,684,484228,790,0005,254,00016,793,600
4Oct 9, 2026 12:001,560244,428,153229,725,0004,292,00016,793,600
5Oct 9, 2026 12:001,561242,814,002230,024,0004,225,00016,793,600
6Oct 9, 2026 12:001,561242,849,861229,944,0004,241,00016,793,600
7Oct 9, 2026 12:001,562242,995,136230,077,0004,278,00016,793,600
8Oct 9, 2026 12:001,571244,551,873231,457,0004,281,00016,793,600
9Oct 9, 2026 12:001,572244,656,795231,557,0004,280,00016,793,600