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 02:30Huy Duc LeHuy Duc LeScore: 3,009Success
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 02:302,957515,904,119443,475,403016,953,344
2Mar 7, 2024 02:302,958502,343,124443,683,666016,961,536
3Mar 7, 2024 02:302,965504,788,075444,720,914016,969,728
4Mar 7, 2024 02:303,005477,162,626422,756,00027,983,00016,957,440
5Mar 7, 2024 02:303,007478,366,477409,978,00040,997,00017,010,688
6Mar 7, 2024 02:303,008474,857,553421,125,00030,008,00017,018,880
7Mar 7, 2024 02:303,009477,779,436423,368,00027,958,00017,031,168
8Mar 7, 2024 02:303,013478,715,185420,901,00030,992,00017,141,760
9Mar 7, 2024 02:303,021480,609,509422,189,00031,013,00017,018,880
10Mar 7, 2024 02:303,024481,477,721421,617,00031,970,00016,982,016
11Mar 7, 2024 02:303,027478,886,123424,992,00028,999,00017,018,880
12Mar 7, 2024 02:303,028485,805,346426,165,00028,010,00016,990,208