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:24Elijah KinElijah KinScore: 12,539Success
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:2612,1851,839,949,1071,805,572,00022,218,00016,793,600
2May 30, 2026 03:2612,3531,865,131,9041,830,614,00022,366,00016,793,600
3May 30, 2026 03:2612,3601,864,745,7821,832,076,00021,935,00016,793,600
4May 30, 2026 03:2612,5051,888,041,2711,853,622,00022,191,00016,793,600
5May 30, 2026 03:2612,5391,892,471,1991,858,873,00021,998,00016,793,600
6May 30, 2026 03:2612,5541,895,561,7921,860,698,00022,534,00016,793,600
7May 30, 2026 03:2612,9771,956,536,0971,924,966,00021,666,00016,793,600
8May 30, 2026 03:2613,6102,052,897,2102,020,119,00021,511,00016,793,600
9May 30, 2026 03:2613,6272,055,478,2672,022,430,00021,751,00016,793,600