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 listJul 12, 2023 20:47gchebanovgchebanovScore: 4,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 20:474,359715,660,338653,870,618016,912,384
2Jul 12, 2023 20:474,360718,212,605653,958,234016,916,480
3Jul 12, 2023 20:474,375712,648,484656,182,035016,924,672
4Jul 12, 2023 20:474,378677,009,423631,666,00024,986,00017,080,320
5Jul 12, 2023 20:474,382685,792,362629,386,00027,972,00016,986,112
6Jul 12, 2023 20:474,384681,370,508634,643,00022,987,00017,018,880
7Jul 12, 2023 20:474,386680,538,000625,897,00031,994,00017,170,432
8Jul 12, 2023 20:474,390682,108,099632,575,00025,982,00017,149,952
9Jul 12, 2023 20:474,396682,569,279636,469,00022,980,00017,072,128
10Jul 12, 2023 20:474,396685,450,487635,470,00023,980,00017,072,128
11Jul 12, 2023 20:474,410683,500,688632,505,00028,977,00017,072,128
12Jul 12, 2023 20:474,431696,709,889638,699,00025,987,00017,170,432