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 listMay 6, 2026 13:21olliecrowolliecrowScore: 42,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 13:2442,7496,432,094,0706,368,996,00043,369,00017,244,160
2May 6, 2026 13:2442,7716,434,212,4236,370,314,00045,387,00017,240,064
3May 6, 2026 13:2442,7716,435,648,3356,370,509,00045,245,00017,207,296
4May 6, 2026 13:2442,7736,436,813,5706,371,886,00044,129,00017,248,256
5May 6, 2026 13:2442,7936,437,561,2446,375,088,00043,955,00017,174,528
6May 6, 2026 13:2443,0366,475,479,4566,393,979,00061,514,00017,043,456
7May 6, 2026 13:2443,0386,473,622,7466,391,253,00064,500,00017,051,648
8May 6, 2026 13:2443,0516,477,485,8776,396,399,00061,377,00017,186,816
9May 6, 2026 13:2443,0686,474,975,3966,400,233,00060,055,00017,092,608