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:28Huy 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:282,961505,352,224444,092,844016,961,536
2Mar 7, 2024 02:282,962515,377,086444,342,807016,957,440
3Mar 7, 2024 02:282,963503,127,201444,385,765016,965,632
4Mar 7, 2024 02:282,993477,455,299421,909,00026,994,00016,957,440
5Mar 7, 2024 02:282,994475,831,988423,072,00026,004,00017,031,168
6Mar 7, 2024 02:282,999479,474,490411,821,00037,983,00017,141,760
7Mar 7, 2024 02:283,004475,130,340419,583,00030,969,00017,014,784
8Mar 7, 2024 02:283,006479,571,390427,859,00022,992,00016,990,208
9Mar 7, 2024 02:283,008481,506,389422,164,00029,011,00016,961,536
10Mar 7, 2024 02:283,008484,908,091421,253,00030,018,00017,072,128
11Mar 7, 2024 02:283,010480,931,737415,527,00035,959,00017,178,624
12Mar 7, 2024 02:283,011479,970,048423,690,00027,979,00017,039,360