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:54olliecrowolliecrowScore: 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:543,614567,057,105523,097,00019,003,00017,100,800
2Mar 4, 2026 20:543,614575,605,278523,107,00019,003,00017,051,648
3Mar 4, 2026 20:543,618570,571,981521,666,00020,986,00017,047,552
4Mar 4, 2026 20:543,620565,592,459521,939,00020,997,00017,018,880
5Mar 4, 2026 20:543,621572,208,373522,112,00021,004,00017,027,072
6Mar 4, 2026 20:543,621580,733,764524,128,00019,004,00017,051,648
7Mar 4, 2026 20:543,621579,716,457521,206,00022,008,00017,051,648
8Mar 4, 2026 20:543,625573,997,245523,689,00019,988,00017,059,840
9Mar 4, 2026 20:543,627570,656,511524,019,00020,000,00017,051,648