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 listMar 19, 2023 19:54Robert BurkeRobert BurkeScore: 4,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2023 19:544,323707,940,502648,439,220016,994,304
2Mar 19, 2023 19:544,327718,068,105649,103,920016,998,400
3Mar 19, 2023 19:544,334707,654,816650,042,950016,998,400
4Mar 19, 2023 19:544,344678,394,515626,618,00024,984,00017,162,240
5Mar 19, 2023 19:544,346677,252,740629,934,00021,997,00017,018,880
6Mar 19, 2023 19:544,351671,605,277630,654,00021,987,00017,022,976
7Mar 19, 2023 19:544,351676,584,703630,707,00021,989,00017,170,432
8Mar 19, 2023 19:544,352676,584,576628,754,00023,990,00017,018,880
9Mar 19, 2023 19:544,352674,672,314630,759,00021,991,00017,129,472
10Mar 19, 2023 19:544,354672,806,957629,138,00023,967,00017,027,072
11Mar 19, 2023 19:544,360683,209,632631,983,00021,999,00017,010,688
12Mar 19, 2023 19:544,362682,298,394630,353,00023,975,00017,035,264