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:39Huy Duc LeHuy Duc LeScore: 2,999Success
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:392,942504,976,247441,236,257016,969,728
2Mar 7, 2024 02:392,944507,005,494441,605,717016,957,440
3Mar 7, 2024 02:392,948502,717,512442,230,604016,969,728
4Mar 7, 2024 02:392,993477,993,703423,951,00024,997,00017,031,168
5Mar 7, 2024 02:392,997471,484,284420,640,00028,975,00017,031,168
6Mar 7, 2024 02:392,999472,522,921415,862,00033,988,00017,039,360
7Mar 7, 2024 02:392,999473,382,189417,896,00031,992,00017,027,072
8Mar 7, 2024 02:393,001476,658,626426,190,00024,010,00017,129,472
9Mar 7, 2024 02:393,003483,073,672419,442,00030,958,00017,031,168
10Mar 7, 2024 02:393,003476,697,099419,525,00030,964,00017,108,992
11Mar 7, 2024 02:393,006472,334,119416,869,00033,989,00017,027,072
12Mar 7, 2024 02:393,007481,715,858424,081,00027,005,00017,014,784