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 listDec 31, 2025 23:50Josu San MartinJosu San MartinScore: 19,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 23:5018,6422,825,634,4552,766,411,00029,939,00017,068,032
2Dec 31, 2025 23:5019,0922,891,838,6242,835,819,00027,948,00017,051,648
3Dec 31, 2025 23:5019,0962,898,749,1442,835,450,00028,943,00016,961,536
4Dec 31, 2025 23:5019,1192,895,673,2412,833,896,00033,926,00016,965,632
5Dec 31, 2025 23:5019,1702,901,086,8412,847,493,00027,945,00017,113,088
6Dec 31, 2025 23:5019,2052,910,268,6442,852,827,00027,939,00017,039,360
7Dec 31, 2025 23:5019,2712,922,076,9752,862,737,00027,938,00017,158,144
8Dec 31, 2025 23:5019,2972,921,135,0772,869,657,00024,953,00017,092,608
9Dec 31, 2025 23:5019,4452,948,690,9842,887,764,00028,947,00017,125,376