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 listJun 24, 2026 12:51anboto1anboto1Score: 3,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 12:513,100474,340,415439,683,00025,347,00016,793,600
2Jun 24, 2026 12:513,104474,864,060440,314,00025,329,00016,793,600
3Jun 24, 2026 12:513,108475,465,539440,929,00025,350,00016,793,600
4Jun 24, 2026 12:513,111476,467,325441,226,00025,538,00016,793,600
5Jun 24, 2026 12:513,116484,102,844441,542,00025,901,00016,793,600
6Jun 24, 2026 12:513,116476,544,329441,353,00026,049,00016,793,600
7Jun 24, 2026 12:513,124477,757,263443,210,00025,504,00016,793,600
8Jun 24, 2026 12:513,126478,000,699444,329,00024,575,00016,793,600
9Jun 24, 2026 12:513,127478,206,859442,801,00026,374,00016,793,600