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 03:06Huy Duc LeHuy Duc LeScore: 3,002Success
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 03:062,947495,427,965442,031,925016,957,440
2Mar 7, 2024 03:062,949509,997,380442,309,186016,969,728
3Mar 7, 2024 03:062,957496,881,963443,597,631016,961,536
4Mar 7, 2024 03:062,998477,782,470418,714,00030,978,00016,973,824
5Mar 7, 2024 03:062,999473,083,465420,840,00028,989,00017,027,072
6Mar 7, 2024 03:062,999473,861,668418,896,00030,992,00017,027,072
7Mar 7, 2024 03:063,002480,467,292418,362,00031,951,00017,014,784
8Mar 7, 2024 03:063,004472,487,277412,675,00037,970,00017,129,472
9Mar 7, 2024 03:063,004479,414,726416,699,00033,975,00017,014,784
10Mar 7, 2024 03:063,005473,404,565418,821,00031,986,00017,178,624
11Mar 7, 2024 03:063,007476,403,562419,035,00032,002,00017,092,608
12Mar 7, 2024 03:063,007477,093,759423,052,00028,003,00017,039,360