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 21:08Yuriy LyfenkoYuriy LyfenkoScore: 3,946Success
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 21:083,921649,137,328588,099,252016,941,056
2Apr 1, 2023 21:083,921648,540,342588,135,717016,941,056
3Apr 1, 2023 21:083,922666,110,881588,244,788016,932,864
4Apr 1, 2023 21:083,943618,470,656565,476,00025,975,00017,096,704
5Apr 1, 2023 21:083,943615,856,864569,498,00021,980,00016,969,728
6Apr 1, 2023 21:083,944616,459,412565,649,00025,983,00017,010,688
7Apr 1, 2023 21:083,946617,578,765563,924,00027,996,00016,957,440
8Apr 1, 2023 21:083,947618,519,014567,063,00025,002,00016,961,536
9Apr 1, 2023 21:083,948624,650,650566,157,00026,007,00017,010,688
10Apr 1, 2023 21:083,948613,476,360565,247,00027,011,00017,190,912
11Apr 1, 2023 21:083,950623,633,599564,489,00027,974,00016,969,728
12Apr 1, 2023 21:083,951619,440,068566,719,00025,987,00016,969,728