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 listJul 29, 2026 15:41anboto1anboto1Score: 3,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 15:423,543541,544,380512,881,00018,688,00016,793,600
2Jul 29, 2026 15:423,550542,832,397513,964,00018,663,00016,793,600
3Jul 29, 2026 15:423,556543,492,263513,894,00019,507,00016,793,600
4Jul 29, 2026 15:423,558543,764,197514,843,00018,902,00016,793,600
5Jul 29, 2026 15:423,569545,380,772516,737,00018,639,00016,793,600
6Jul 29, 2026 15:423,575547,038,461516,971,00019,395,00016,793,600
7Jul 29, 2026 15:423,587550,756,847518,438,00019,631,00016,793,600
8Jul 29, 2026 15:423,633555,065,271525,315,00019,641,00016,793,600
9Jul 29, 2026 15:423,672562,079,848532,637,00018,308,00016,793,600