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 17:11anboto1anboto1Score: 2,920Success
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 17:122,914447,233,988428,513,0008,720,00016,793,600
2Jul 29, 2026 17:122,914447,075,551428,502,0008,626,00016,793,600
3Jul 29, 2026 17:122,915447,434,527428,637,0008,737,00016,793,600
4Jul 29, 2026 17:122,918447,752,031429,133,0008,674,00016,793,600
5Jul 29, 2026 17:122,920448,736,757429,248,0008,850,00016,793,600
6Jul 29, 2026 17:122,920448,020,223429,307,0008,703,00016,793,600
7Jul 29, 2026 17:122,920448,288,190429,367,0008,763,00016,793,600
8Jul 29, 2026 17:122,921448,261,213429,462,0008,774,00016,793,600
9Jul 29, 2026 17:122,924448,916,062430,008,0008,731,00016,793,600