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 listSep 21, 2026 15:30Andrew EpsteinAndrew EpsteinScore: 1,633Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 15:311,632256,077,656240,632,0004,306,00016,793,600
2Sep 21, 2026 15:311,632255,333,420240,616,0004,329,00016,793,600
3Sep 21, 2026 15:311,633255,495,044240,687,0004,361,00016,793,600
4Sep 21, 2026 15:311,633255,595,799240,755,0004,224,00016,793,600
5Sep 21, 2026 15:311,633256,063,904240,741,0004,323,00016,793,600
6Sep 21, 2026 15:311,633256,238,705240,610,0004,374,00016,793,600
7Sep 21, 2026 15:311,635256,577,597240,103,0005,228,00016,793,600
8Sep 21, 2026 15:311,636256,754,128241,147,0004,382,00016,793,600
9Sep 21, 2026 15:311,637256,159,006241,332,0004,225,00016,793,600