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:04Andrew EpsteinAndrew EpsteinScore: 1,654Success
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:041,652259,080,523240,563,0007,365,00016,793,600
2Sep 21, 2026 15:041,653258,520,577240,624,0007,429,00016,793,600
3Sep 21, 2026 15:041,654258,712,090240,680,0007,462,00016,793,600
4Sep 21, 2026 15:041,654258,879,309240,765,0007,386,00016,793,600
5Sep 21, 2026 15:041,654259,298,938240,740,0007,392,00016,793,600
6Sep 21, 2026 15:041,656259,746,505241,038,0007,501,00016,793,600
7Sep 21, 2026 15:041,656259,069,660241,040,0007,370,00016,793,600
8Sep 21, 2026 15:041,656259,709,635241,081,0007,430,00016,793,600
9Sep 21, 2026 15:041,657259,491,909241,119,0007,444,00016,793,600