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 04:34Yuriy LyfenkoYuriy LyfenkoScore: 33,995Success
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 04:3333,9695,153,616,6945,095,371,130016,936,960
2Apr 1, 2023 04:3333,9815,188,518,7805,097,100,173016,941,056
3Apr 1, 2023 04:3433,9895,163,759,0975,098,338,744016,941,056
4Apr 1, 2023 04:3433,9955,154,066,3775,099,319,496016,936,960
5Apr 1, 2023 04:3434,0025,161,218,6385,100,371,364016,941,056
6Apr 1, 2023 04:3334,0055,182,362,4985,100,748,257016,941,056