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 listDec 29, 2024 21:55Joad NacerJoad NacerScore: 4,187Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 21:104,177657,015,569579,537,00046,962,00017,055,744
2Dec 29, 2024 21:104,179651,420,631581,861,00044,989,00017,043,456
3Dec 29, 2024 21:554,181653,937,558587,190,00040,012,00017,133,568
4Dec 29, 2024 21:554,181656,921,676583,199,00044,015,00017,047,552
5Dec 29, 2024 21:554,183654,433,904582,557,00044,965,00017,055,744
6Dec 29, 2024 21:104,185654,932,834588,797,00038,986,00017,051,648
7Dec 29, 2024 21:104,185651,029,940589,758,00037,984,00017,051,648
8Dec 29, 2024 21:104,185650,377,248585,697,00041,978,00017,113,088
9Dec 29, 2024 21:104,186654,290,085583,870,00043,990,00017,137,664
10Dec 29, 2024 21:104,187650,916,709587,035,00041,002,00017,104,896
11Dec 29, 2024 21:104,188648,571,630586,163,00042,011,00017,137,664
12Dec 29, 2024 21:554,190652,991,975585,522,00042,964,00016,961,536
13Dec 29, 2024 21:104,191652,900,394584,634,00043,972,00017,108,992
14Dec 29, 2024 21:554,191657,271,090580,629,00047,969,00017,154,048
15Dec 29, 2024 21:554,191655,791,324584,697,00043,977,00017,149,952
16Dec 29, 2024 21:554,192652,094,674581,812,00046,984,00017,051,648
17Dec 29, 2024 21:554,192656,515,887588,862,00039,990,00016,961,536
18Dec 29, 2024 21:554,194656,916,872588,042,00041,002,00017,162,240