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:56Andrew EpsteinAndrew EpsteinScore: 1,661Success
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:561,659259,165,151242,241,0006,650,00016,793,600
2Sep 21, 2026 14:561,660259,257,344242,378,0006,665,00016,793,600
3Sep 21, 2026 14:561,660260,064,073241,903,0007,231,00016,793,600
4Sep 21, 2026 14:561,660259,428,157242,434,0006,653,00016,793,600
5Sep 21, 2026 14:561,661260,077,263241,882,0007,296,00016,793,600
6Sep 21, 2026 14:561,661260,247,360242,522,0006,742,00016,793,600
7Sep 21, 2026 14:561,664259,843,048242,905,0006,719,00016,793,600
8Sep 21, 2026 14:561,664259,900,618242,348,0007,272,00016,793,600
9Sep 21, 2026 14:561,666261,265,076242,650,0007,273,00016,793,600