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 listApr 16, 2026 21:21Jasper EdbrookeJasper EdbrookeScore: 11,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 22:2111,2021,708,074,0001,593,446,00086,915,00017,080,320
2Apr 16, 2026 21:2111,2041,711,721,0891,589,642,00090,922,00017,084,416
3Apr 16, 2026 21:2111,2041,704,782,7191,596,637,00083,928,00017,211,392
4Apr 16, 2026 21:2111,2081,718,132,4771,592,354,00088,908,00017,080,320
5Apr 16, 2026 21:2111,2101,709,612,3941,589,569,00091,917,00017,178,624
6Apr 16, 2026 22:2111,2111,717,631,3781,573,755,000107,914,00017,125,376
7Apr 16, 2026 21:2111,2251,717,219,8601,592,819,00090,932,00017,149,952
8Apr 16, 2026 21:2111,2381,714,089,3681,582,840,000102,924,00017,117,184
9Apr 16, 2026 22:2111,2411,716,111,1171,596,256,00089,901,00017,076,224
10Apr 16, 2026 21:2111,2431,708,272,8801,608,465,00077,925,00017,080,320
11Apr 16, 2026 21:2111,3211,725,894,7561,612,237,00085,906,00017,010,688
12Apr 16, 2026 21:2111,3321,733,603,5881,611,889,00087,884,00017,207,296