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 17, 2026 00:47Jasper EdbrookeJasper EdbrookeScore: 10,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 00:4710,6761,632,471,8431,503,531,00097,904,00017,088,512
2Apr 17, 2026 00:4710,7041,637,658,3081,506,736,00098,917,00017,227,776
3Apr 17, 2026 00:4710,7111,637,671,2241,513,704,00092,920,00017,203,200
4Apr 17, 2026 00:4710,7181,636,343,2131,515,719,00091,922,00017,145,856
5Apr 17, 2026 00:4710,7311,634,003,1291,508,688,000100,912,00017,072,128
6Apr 17, 2026 00:4710,7401,640,684,1211,521,170,00089,891,00017,059,840
7Apr 17, 2026 00:4710,7651,643,530,4541,514,793,00099,920,00017,145,856
8Apr 17, 2026 00:4710,7751,648,282,3371,522,224,00093,952,00017,002,496
9Apr 17, 2026 00:4710,7881,649,009,6251,531,320,00086,904,00017,063,936