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 19, 2024 04:22Huy Duc LeHuy Duc LeScore: 3,000Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2024 04:222,963501,558,937444,480,435016,957,440
2Mar 19, 2024 04:222,970514,947,660445,533,048016,961,536
3Mar 19, 2024 04:222,973514,405,691445,881,573016,957,440
4Mar 19, 2024 04:222,998475,646,709418,752,00030,981,00016,973,824
5Mar 19, 2024 04:222,999474,074,596415,928,00033,994,00017,022,976
6Mar 19, 2024 04:223,000475,138,602413,932,00035,994,00017,018,880
7Mar 19, 2024 04:223,000472,985,814420,955,00028,996,00017,031,168
8Mar 19, 2024 04:223,001476,778,884414,069,00036,006,00017,195,008
9Mar 19, 2024 04:223,001478,206,276416,152,00034,012,00017,125,376
10Mar 19, 2024 04:223,003476,017,466416,500,00033,959,00017,010,688
11Mar 19, 2024 04:223,007477,143,198424,015,00027,000,00017,022,976
12Mar 19, 2024 04:223,012475,197,561422,786,00028,985,00017,018,880