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 27, 2024 01:39Joad NacerJoad NacerScore: 4,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2024 01:394,222659,277,526587,256,00046,020,00017,199,104
2Dec 27, 2024 01:394,225655,497,519592,758,00040,983,00017,035,264
3Dec 27, 2024 01:394,226659,157,231591,930,00041,995,00017,059,840
4Dec 27, 2024 01:394,227659,166,692592,018,00042,001,00016,953,344
5Dec 27, 2024 01:394,230657,798,625598,485,00035,969,00017,129,472
6Dec 27, 2024 01:394,232657,576,759594,813,00039,987,00017,039,360
7Dec 27, 2024 01:394,233656,269,949584,987,00049,998,00017,068,032
8Dec 27, 2024 01:394,234661,630,987596,148,00039,009,00017,182,720
9Dec 27, 2024 01:394,238657,746,857586,673,00048,972,00017,039,360