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 28, 2024 01:00Joad NacerJoad NacerScore: 4,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 01:004,219657,757,652590,868,00041,990,00016,957,440
2Dec 28, 2024 01:004,222657,476,666596,223,00037,013,00017,162,240
3Dec 28, 2024 01:004,224656,050,302585,631,00047,969,00016,957,440
4Dec 28, 2024 01:004,224656,648,023589,647,00043,973,00017,149,952
5Dec 28, 2024 01:004,224654,680,662592,684,00040,978,00017,047,552
6Dec 28, 2024 01:004,225655,625,214585,787,00047,982,00016,957,440
7Dec 28, 2024 01:004,227660,490,690592,050,00042,003,00017,141,760
8Dec 28, 2024 01:004,228661,482,072591,220,00043,016,00017,047,552
9Dec 28, 2024 01:004,230659,482,432589,521,00044,963,00016,957,440