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 listSep 21, 2026 17:49Andrew EpsteinAndrew EpsteinScore: 1,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 17:531,578247,946,177232,614,0004,207,00016,797,696
2Sep 21, 2026 17:531,578248,125,036232,528,0004,305,00016,797,696
3Sep 21, 2026 17:531,579245,542,532232,584,0004,268,00016,797,696
4Sep 21, 2026 17:531,579245,675,438232,652,0004,253,00016,797,696
5Sep 21, 2026 17:531,579247,581,110232,697,0004,230,00016,797,696
6Sep 21, 2026 17:531,579245,802,268232,664,0004,215,00016,797,696
7Sep 21, 2026 17:531,582246,364,163233,126,0004,201,00016,797,696
8Sep 21, 2026 17:531,582246,551,863233,226,0004,203,00016,797,696
9Sep 21, 2026 17:531,582246,496,566233,170,0004,213,00016,797,696