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 listApr 1, 2023 19:26Yuriy LyfenkoYuriy LyfenkoScore: 4,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 19:264,136694,074,096620,374,523016,936,960
2Apr 1, 2023 19:264,137692,526,739620,618,570016,932,864
3Apr 1, 2023 19:264,141679,055,292621,079,683016,945,152
4Apr 1, 2023 19:264,167648,046,929599,140,00025,962,00016,961,536
5Apr 1, 2023 19:264,180652,850,970597,064,00029,953,00016,953,344
6Apr 1, 2023 19:264,185657,419,943604,827,00022,993,00016,973,824
7Apr 1, 2023 19:264,188652,438,256602,178,00025,964,00016,969,728
8Apr 1, 2023 19:264,188648,595,775603,215,00024,967,00017,141,760
9Apr 1, 2023 19:264,191650,750,718602,628,00025,983,00017,113,088
10Apr 1, 2023 19:264,194656,813,003606,083,00022,965,00016,957,440
11Apr 1, 2023 19:264,194652,981,971602,116,00026,960,00016,945,152
12Apr 1, 2023 19:264,201656,731,157602,174,00027,961,00017,178,624