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 14:22Andrew EpsteinAndrew EpsteinScore: 1,803Success
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 14:221,801280,358,363260,519,0009,648,00016,793,600
2Sep 21, 2026 14:221,802280,772,806260,670,0009,766,00016,793,600
3Sep 21, 2026 14:221,802280,726,114260,662,0009,722,00016,793,600
4Sep 21, 2026 14:221,802280,709,042260,794,0009,655,00016,793,600
5Sep 21, 2026 14:221,803280,793,730260,896,0009,608,00016,793,600
6Sep 21, 2026 14:221,804281,006,541260,885,0009,738,00016,793,600
7Sep 21, 2026 14:221,805285,225,917261,036,0009,754,00016,793,600
8Sep 21, 2026 14:221,810281,959,515261,962,0009,686,00016,793,600
9Sep 21, 2026 14:221,811281,843,895261,845,0009,865,00016,793,600