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:44Huy Duc LeHuy Duc LeScore: 3,004Success
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:442,943504,897,178441,503,667016,965,632
2Mar 7, 2024 02:442,947493,604,107441,978,235016,969,728
3Mar 7, 2024 02:442,951506,243,960442,650,978016,961,536
4Mar 7, 2024 02:443,000480,801,883418,011,00032,000,00017,149,952
5Mar 7, 2024 02:443,001476,396,691419,208,00031,015,00017,178,624
6Mar 7, 2024 02:443,003478,437,294421,482,00028,964,00017,088,512
7Mar 7, 2024 02:443,004475,471,400421,625,00028,974,00017,031,168
8Mar 7, 2024 02:443,005474,932,318423,819,00026,988,00017,022,976
9Mar 7, 2024 02:443,008475,456,150419,120,00032,009,00017,006,592
10Mar 7, 2024 02:443,010475,492,169416,590,00034,965,00017,027,072
11Mar 7, 2024 02:443,015478,485,629426,270,00026,016,00016,990,208
12Mar 7, 2024 02:443,018479,507,125416,690,00035,973,00017,199,104