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:20Elijah KinElijah KinScore: 55,104Success
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:2354,5078,199,779,9228,129,648,00046,452,00016,793,600
2May 30, 2026 03:2354,9518,254,416,3288,200,786,00041,904,00016,793,600
3May 30, 2026 03:2354,9968,259,895,6228,204,872,00044,569,00016,793,600
4May 30, 2026 03:2355,0268,265,002,5738,209,687,00044,262,00016,793,600
5May 30, 2026 03:2355,1048,278,426,4228,220,072,00045,662,00016,793,600
6May 30, 2026 03:2355,4698,330,950,2688,275,544,00044,843,00016,793,600
7May 30, 2026 03:2357,0708,570,719,1298,522,026,00038,567,00016,793,600
8May 30, 2026 03:2357,3548,615,082,2308,565,826,00037,301,00016,793,600
9May 30, 2026 03:2357,3678,627,802,8208,566,031,00039,099,00016,793,600