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 24, 2023 16:33Yuriy LyfenkoYuriy LyfenkoScore: 4,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 16:334,258707,548,754638,747,045016,941,056
2Mar 24, 2023 16:334,276709,479,889641,400,875016,941,056
3Mar 24, 2023 16:334,295706,143,183644,215,528016,936,960
4Mar 24, 2023 16:334,457694,203,693644,527,00023,982,00017,186,816
5Mar 24, 2023 16:334,474699,577,389648,068,00022,967,00017,076,224
6Mar 24, 2023 16:334,531704,741,599654,603,00024,984,00017,100,800
7Mar 24, 2023 16:334,537702,850,802653,598,00026,983,00017,006,592
8Mar 24, 2023 16:334,563713,098,837657,430,00026,976,00016,957,440
9Mar 24, 2023 16:334,564705,380,133662,657,00021,988,00017,186,816
10Mar 24, 2023 16:334,569712,728,782660,364,00024,975,00016,953,344
11Mar 24, 2023 16:334,608716,831,326666,190,00024,969,00016,961,536
12Mar 24, 2023 16:334,640731,450,003671,982,00023,963,00016,961,536