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 listJan 5, 2026 02:52Josu San MartinJosu San MartinScore: 3,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 02:523,272517,421,353447,765,00042,977,00017,072,128
2Jan 5, 2026 02:523,276516,298,313454,470,00036,956,00016,961,536
3Jan 5, 2026 02:523,277526,448,763448,543,00042,956,00017,076,224
4Jan 5, 2026 02:523,277516,483,842451,613,00039,965,00017,080,320
5Jan 5, 2026 02:523,278516,365,216445,666,00045,965,00017,063,936
6Jan 5, 2026 02:523,282521,891,884450,358,00041,940,00017,068,032
7Jan 5, 2026 02:523,291517,340,400452,685,00040,971,00017,178,624
8Jan 5, 2026 02:523,295522,515,119454,246,00039,933,00017,063,936
9Jan 5, 2026 02:523,325524,568,767458,796,00039,982,00017,080,320