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 21:01anboto1anboto1Score: 3,800Success
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 21:023,790578,574,676543,604,00025,003,00016,793,600
2Jul 29, 2026 21:023,793578,974,820543,631,00025,384,00016,793,600
3Jul 29, 2026 21:023,795579,322,999543,950,00025,338,00016,793,600
4Jul 29, 2026 21:023,800580,185,094544,988,00025,120,00016,793,600
5Jul 29, 2026 21:023,800580,201,136545,114,00024,984,00016,793,600
6Jul 29, 2026 21:023,803580,582,150545,065,00025,491,00016,793,600
7Jul 29, 2026 21:023,805580,810,855545,302,00025,531,00016,793,600
8Jul 29, 2026 21:023,809581,648,618545,999,00025,495,00016,793,600
9Jul 29, 2026 21:023,840587,836,693550,842,00025,301,00016,793,600