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 listMar 4, 2026 20:57olliecrowolliecrowScore: 3,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 20:573,614570,762,523522,044,00020,001,00017,059,840
2Mar 4, 2026 20:573,617570,229,602516,503,00025,975,00017,035,264
3Mar 4, 2026 20:573,617570,212,403517,625,00024,981,00017,043,456
4Mar 4, 2026 20:573,618569,997,840520,692,00021,987,00017,047,552
5Mar 4, 2026 20:573,621571,794,893521,109,00022,004,00016,973,824
6Mar 4, 2026 20:573,621571,024,991523,206,00020,007,00017,055,744
7Mar 4, 2026 20:573,622572,233,650523,289,00020,011,00017,108,992
8Mar 4, 2026 20:573,624571,627,565520,596,00022,982,00017,178,624
9Mar 4, 2026 20:573,634572,131,237524,137,00021,005,00017,047,552