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:41Huy Duc LeHuy Duc LeScore: 3,001Success
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:412,945510,058,877441,792,920016,961,536
2Mar 7, 2024 02:412,947494,452,154441,990,441016,957,440
3Mar 7, 2024 02:412,948502,352,912442,189,072016,965,632
4Mar 7, 2024 02:412,995480,389,444418,288,00031,021,00017,121,280
5Mar 7, 2024 02:412,999478,346,650422,796,00026,987,00016,990,208
6Mar 7, 2024 02:413,001472,605,595426,155,00024,008,00017,055,744
7Mar 7, 2024 02:413,001481,848,966418,194,00032,014,00017,018,880
8Mar 7, 2024 02:413,005472,534,736423,808,00026,987,00017,010,688
9Mar 7, 2024 02:413,005475,384,369420,823,00029,987,00017,022,976
10Mar 7, 2024 02:413,006472,818,874414,855,00035,987,00017,043,456
11Mar 7, 2024 02:413,007475,187,620419,114,00032,008,00017,014,784
12Mar 7, 2024 02:413,012481,430,942422,848,00028,989,00017,113,088