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 listMay 22, 2024 18:27Joad NacerJoad NacerScore: 4,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 18:274,563712,085,775637,520,00046,964,00017,158,144
2May 22, 2024 18:274,564711,252,631641,694,00042,979,00017,133,568
3May 22, 2024 18:274,567711,308,766646,090,00039,005,00017,149,952
4May 22, 2024 18:274,574717,435,841645,153,00041,009,00017,149,952
5May 22, 2024 18:274,576717,494,185643,408,00043,027,00017,010,688
6May 22, 2024 18:274,579716,655,523642,796,00043,986,00017,149,952
7May 22, 2024 18:274,583714,171,258642,490,00044,964,00016,990,208
8May 22, 2024 18:274,583716,123,737640,513,00046,964,00017,022,976
9May 22, 2024 18:274,593713,772,105647,002,00042,000,00017,199,104
10May 22, 2024 18:274,624752,882,456693,551,535016,924,672
11May 22, 2024 18:274,624749,626,756693,575,633016,916,480
12May 22, 2024 18:274,638759,961,455695,658,130016,932,864