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 7, 2026 19:07Karthik ReddyKarthik ReddyScore: 1,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 19:081,764274,061,990256,453,0008,270,00016,793,600
2Oct 7, 2026 19:081,765274,050,753256,541,0008,323,00016,793,600
3Oct 7, 2026 19:081,765273,813,218256,552,0008,251,00016,793,600
4Oct 7, 2026 19:081,765273,895,621256,430,0008,383,00016,793,600
5Oct 7, 2026 19:081,767275,789,251256,701,0008,491,00016,793,600
6Oct 7, 2026 19:081,768274,271,572256,932,0008,317,00016,793,600
7Oct 7, 2026 19:081,769274,557,902256,992,0008,422,00016,793,600
8Oct 7, 2026 19:081,773275,135,164257,635,0008,407,00016,793,600
9Oct 7, 2026 19:081,792278,074,253260,205,0008,612,00016,793,600