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:41Huy Duc LeHuy Duc LeScore: 3,019Success
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:412,964498,563,864444,533,371016,961,536
2Mar 7, 2024 00:412,967508,308,218445,031,331016,961,536
3Mar 7, 2024 00:412,972519,079,771445,734,294016,965,632
4Mar 7, 2024 00:413,013475,251,157415,927,00035,993,00017,018,880
5Mar 7, 2024 00:413,015477,663,834425,171,00027,010,00017,010,688
6Mar 7, 2024 00:413,018479,218,049422,715,00029,979,00016,982,016
7Mar 7, 2024 00:413,019474,462,353415,867,00036,988,00017,113,088
8Mar 7, 2024 00:413,021480,389,596422,120,00031,008,00017,178,624
9Mar 7, 2024 00:413,023484,497,888419,518,00033,961,00017,018,880
10Mar 7, 2024 00:413,024479,319,888425,678,00027,978,00017,145,856
11Mar 7, 2024 00:413,028481,266,088420,182,00034,014,00017,059,840
12Mar 7, 2024 00:413,071485,064,588436,732,00023,985,00017,149,952