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 20:28Yuriy LyfenkoYuriy LyfenkoScore: 3,988Success
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 20:283,966662,287,360594,912,729016,932,864
2Apr 1, 2023 20:283,967661,279,730594,984,755016,936,960
3Apr 1, 2023 20:283,969655,788,161595,311,089016,936,960
4Apr 1, 2023 20:283,987625,508,123573,001,00025,000,00016,957,440
5Apr 1, 2023 20:283,987620,779,961574,118,00024,004,00016,957,440
6Apr 1, 2023 20:283,988621,350,280572,132,00026,006,00016,969,728
7Apr 1, 2023 20:283,988628,139,625574,205,00024,008,00016,961,536
8Apr 1, 2023 20:283,988624,522,507575,219,00023,008,00017,080,320
9Apr 1, 2023 20:283,990623,006,943574,533,00023,980,00017,186,816
10Apr 1, 2023 20:283,990622,909,546576,590,00021,984,00017,035,264
11Apr 1, 2023 20:283,992625,504,628573,848,00024,993,00017,121,280
12Apr 1, 2023 20:283,995622,525,330574,205,00025,008,00017,154,048