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 20, 2023 04:07Yuriy LyfenkoYuriy LyfenkoScore: 7,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2023 04:065,688925,009,093853,137,803016,965,632
2Apr 20, 2023 04:065,713923,258,662856,892,001016,953,344
3Apr 20, 2023 04:065,730919,794,962859,550,957016,965,632
4Apr 20, 2023 04:077,0441,121,097,7551,056,545,431016,961,536
5Apr 20, 2023 04:077,0451,124,939,0941,056,794,380016,961,536
6Apr 20, 2023 04:077,0701,134,774,3981,060,557,678016,965,632