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 21, 2023 04:13Yuriy LyfenkoYuriy LyfenkoScore: 4,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2023 04:134,321716,952,482648,178,234016,953,344
2Mar 21, 2023 04:134,322718,776,248648,334,956016,945,152
3Mar 21, 2023 04:134,364679,332,211628,682,00025,945,00017,051,648
4Mar 21, 2023 04:134,371717,529,496655,630,470016,953,344
5Mar 21, 2023 04:134,388685,289,065633,241,00024,970,00017,121,280
6Mar 21, 2023 04:134,500699,319,232648,102,00026,962,00016,969,728
7Mar 21, 2023 04:134,503702,482,972650,460,00024,979,00016,969,728
8Mar 21, 2023 04:134,531704,266,770654,712,00024,989,00017,068,032
9Mar 21, 2023 04:134,542703,409,637655,327,00025,973,00017,190,912
10Mar 21, 2023 04:134,561706,243,868662,159,00021,972,00017,068,032
11Mar 21, 2023 04:134,628723,712,040668,265,00025,971,00016,965,632
12Mar 21, 2023 04:134,659725,664,460673,943,00024,960,00017,186,816