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 listMar 7, 2024 03:55Huy Duc LeHuy Duc LeScore: 3,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 03:552,945505,810,456441,818,317016,965,632
2Mar 7, 2024 03:552,948501,313,506442,268,050016,965,632
3Mar 7, 2024 03:552,956521,262,660443,359,667016,961,536
4Mar 7, 2024 03:552,999476,045,420421,824,00027,988,00017,190,912
5Mar 7, 2024 03:553,005477,336,244420,757,00029,982,00017,014,784
6Mar 7, 2024 03:553,006480,607,188418,930,00031,994,00017,027,072
7Mar 7, 2024 03:553,008482,648,819420,211,00031,015,00017,027,072
8Mar 7, 2024 03:553,008481,098,969423,227,00028,015,00017,002,496
9Mar 7, 2024 03:553,010484,920,163418,494,00032,960,00017,141,760
10Mar 7, 2024 03:553,012474,357,206417,775,00033,981,00017,203,200
11Mar 7, 2024 03:553,020474,907,021421,065,00032,004,00017,031,168
12Mar 7, 2024 03:553,031478,265,133426,676,00027,978,00017,133,568