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:50Jasper EdbrookeJasper EdbrookeScore: 10,664Success
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:5010,6271,623,451,0571,503,229,00090,892,00017,207,296
2Apr 17, 2026 00:5010,6401,629,149,8141,499,112,00096,878,00016,986,112
3Apr 17, 2026 00:5010,6631,627,768,7561,516,592,00082,923,00017,080,320
4Apr 17, 2026 00:5010,6641,628,122,4221,504,632,00094,913,00017,055,744
5Apr 17, 2026 00:5010,6641,622,774,5671,493,683,000105,906,00016,986,112
6Apr 17, 2026 00:5010,6751,632,694,3331,517,381,00083,910,00017,199,104
7Apr 17, 2026 00:5010,6931,637,657,2451,502,129,000101,873,00016,965,632
8Apr 17, 2026 00:5010,7021,630,266,4521,512,397,00092,901,00017,059,840
9Apr 17, 2026 00:5025,5163,863,064,5143,740,403,00086,939,00017,080,320