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 listMay 30, 2026 03:47Elijah KinElijah KinScore: 6,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:476,7281,032,421,689985,567,00023,704,00016,793,600
2May 30, 2026 03:476,9371,049,965,9441,016,218,00024,400,00016,793,600
3May 30, 2026 03:476,9511,065,741,3811,018,055,00024,707,00016,793,600
4May 30, 2026 03:476,9511,052,768,9291,018,135,00024,603,00016,793,600
5May 30, 2026 03:476,9731,057,163,9771,021,576,00024,522,00016,793,600
6May 30, 2026 03:476,9771,057,684,0631,021,659,00024,928,00016,793,600
7May 30, 2026 03:477,0081,073,936,9101,026,850,00024,412,00016,793,600
8May 30, 2026 03:477,0171,074,091,1701,027,959,00024,658,00016,793,600
9May 30, 2026 03:477,1031,086,699,8301,041,052,00024,450,00016,793,600