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 01:19Jasper EdbrookeJasper EdbrookeScore: 10,235Success
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 01:1910,2081,556,868,7641,438,241,00092,886,00017,084,416
2Apr 17, 2026 01:1910,2251,563,694,1921,444,817,00088,927,00017,195,008
3Apr 17, 2026 01:1910,2291,566,040,1841,449,376,00084,904,00017,231,872
4Apr 17, 2026 01:1910,2351,564,503,7391,444,307,00090,893,00017,080,320
5Apr 17, 2026 01:1910,2351,563,125,0281,440,382,00094,893,00017,063,936
6Apr 17, 2026 01:1910,2501,566,922,6881,448,607,00088,914,00017,014,784
7Apr 17, 2026 01:1910,2731,569,164,3531,440,152,000100,870,00017,199,104
8Apr 17, 2026 01:1910,3431,575,917,5711,454,568,00096,904,00017,174,528
9Apr 17, 2026 01:1910,3711,579,742,1141,454,683,000100,908,00017,207,296