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 listNov 4, 2026 00:12Andrew EpsteinAndrew EpsteinScore: 1,595Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 00:131,594248,485,513234,853,0004,360,00016,793,600
2Nov 4, 2026 00:131,594248,459,480235,008,0004,229,00016,797,696
3Nov 4, 2026 00:131,594250,006,102235,020,0004,221,00016,793,600
4Nov 4, 2026 00:131,595248,679,798235,158,0004,129,00016,793,600
5Nov 4, 2026 00:131,595248,669,021235,057,0004,227,00016,793,600
6Nov 4, 2026 00:131,595248,784,728235,079,0004,283,00016,793,600
7Nov 4, 2026 00:131,598249,039,211235,530,0004,263,00016,793,600
8Nov 4, 2026 00:131,598249,034,821235,501,0004,262,00016,793,600
9Nov 4, 2026 00:131,600249,350,792235,937,0004,127,00016,793,600