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 17, 2025 22:22Ian MckibbenIan MckibbenScore: 12,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 22:2211,7851,800,322,1541,741,790,00025,937,00016,953,344
2Jan 17, 2025 22:2212,0491,832,148,0231,786,458,00020,958,00016,969,728
3Jan 17, 2025 22:2212,3451,883,761,6421,827,791,00023,944,00017,068,032
4Jan 17, 2025 22:2212,4901,900,233,6311,849,621,00023,943,00016,965,632
5Jan 17, 2025 22:2212,6161,923,916,0251,869,445,00022,944,00017,022,976
6Jan 17, 2025 22:2212,6211,920,493,0171,872,210,00020,946,00016,953,344
7Jan 17, 2025 22:2212,6751,931,572,9501,876,349,00024,938,00016,953,344
8Jan 17, 2025 22:2212,7271,936,975,6071,885,158,00023,951,00017,100,800
9Jan 17, 2025 22:2212,9421,973,072,3181,917,320,00023,941,00016,973,824