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,020Success
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,964509,316,852444,643,631016,957,440
2Mar 7, 2024 00:422,966510,496,715444,852,844016,965,632
3Mar 7, 2024 00:422,969508,237,223445,389,147016,965,632
4Mar 7, 2024 00:423,013477,949,058422,902,00028,993,00017,039,360
5Mar 7, 2024 00:423,017481,616,900431,614,00020,981,00017,018,880
6Mar 7, 2024 00:423,018475,378,624419,749,00032,980,00017,039,360
7Mar 7, 2024 00:423,020478,366,224420,978,00031,998,00017,100,800
8Mar 7, 2024 00:423,023487,420,284423,512,00029,965,00017,027,072
9Mar 7, 2024 00:423,024477,136,929420,673,00032,974,00017,022,976
10Mar 7, 2024 00:423,027485,246,762420,075,00034,006,00017,027,072
11Mar 7, 2024 00:423,027475,617,882425,081,00029,005,00017,014,784
12Mar 7, 2024 00:423,028481,104,738424,252,00030,017,00017,129,472