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 00:42Huy Duc LeHuy Duc LeScore: 3,021Success
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 00:422,966497,416,766444,848,667016,957,440
2Mar 7, 2024 00:422,966502,021,741444,858,582016,961,536
3Mar 7, 2024 00:422,969506,708,295445,379,704016,965,632
4Mar 7, 2024 00:423,015480,564,973425,263,00027,016,00017,027,072
5Mar 7, 2024 00:423,016484,359,987424,496,00027,966,00017,014,784
6Mar 7, 2024 00:423,020481,210,212422,047,00031,003,00017,031,168
7Mar 7, 2024 00:423,021484,462,604421,096,00032,007,00017,186,816
8Mar 7, 2024 00:423,023480,507,365420,499,00032,960,00016,961,536
9Mar 7, 2024 00:423,024479,050,057417,666,00035,971,00017,027,072
10Mar 7, 2024 00:423,032483,996,736424,854,00029,989,00017,027,072
11Mar 7, 2024 00:423,034481,949,416423,052,00032,003,00017,100,800
12Mar 7, 2024 00:423,036481,480,115421,385,00034,031,00017,039,360