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 17:08Andrew 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
1Sep 21, 2026 17:091,594249,394,661234,816,0004,324,00016,793,600
2Sep 21, 2026 17:091,594250,083,982234,821,0004,311,00016,793,600
3Sep 21, 2026 17:091,595250,271,169235,173,0004,188,00016,793,600
4Sep 21, 2026 17:091,595250,363,642235,126,0004,218,00016,793,600
5Sep 21, 2026 17:091,595250,341,565235,139,0004,239,00016,793,600
6Sep 21, 2026 17:091,595249,669,301235,007,0004,339,00016,793,600
7Sep 21, 2026 17:091,599251,312,952235,655,0004,222,00016,793,600
8Sep 21, 2026 17:091,599250,317,366235,708,0004,258,00016,793,600
9Sep 21, 2026 17:091,600250,479,766235,842,0004,246,00016,793,600