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:34Huy 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 02:342,971499,821,816445,724,482016,965,632
2Mar 7, 2024 02:342,973501,427,669445,917,950016,965,632
3Mar 7, 2024 02:342,979512,768,607446,834,496016,965,632
4Mar 7, 2024 02:343,015484,421,857429,216,00023,011,00017,055,744
5Mar 7, 2024 02:343,019479,049,595421,883,00030,991,00017,195,008
6Mar 7, 2024 02:343,020475,581,922425,955,00026,997,00017,022,976
7Mar 7, 2024 02:343,020479,899,998414,056,00039,005,00017,158,144
8Mar 7, 2024 02:343,020481,192,969419,060,00034,004,00017,014,784
9Mar 7, 2024 02:343,022479,407,129422,371,00030,953,00017,166,336
10Mar 7, 2024 02:343,024480,238,582425,566,00027,971,00017,166,336
11Mar 7, 2024 02:343,025478,731,262421,698,00031,977,00017,018,880
12Mar 7, 2024 02:343,025480,200,024424,732,00028,981,00017,059,840