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 28, 2024 02:00Joad NacerJoad NacerScore: 4,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 02:004,183656,906,190584,515,00042,964,00017,055,744
2Dec 28, 2024 02:004,185648,556,938583,793,00043,984,00017,055,744
3Dec 28, 2024 02:004,187652,375,908582,088,00046,007,00017,186,816
4Dec 28, 2024 02:004,191650,176,251582,702,00045,976,00017,055,744
5Dec 28, 2024 02:004,192650,834,258583,859,00044,989,00017,051,648
6Dec 28, 2024 02:004,194651,412,409584,141,00045,010,00017,137,664
7Dec 28, 2024 02:004,195650,698,210584,207,00045,016,00017,010,688
8Dec 28, 2024 02:004,196658,092,129583,460,00045,957,00017,100,800
9Dec 28, 2024 02:004,197654,896,013581,615,00047,968,00017,051,648