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,295Success
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:084,283662,121,112597,465,00044,959,00016,945,152
2Dec 29, 2024 21:084,288673,770,422600,169,00043,012,00017,137,664
3Dec 29, 2024 21:554,290668,349,310603,537,00039,969,00017,145,856
4Dec 29, 2024 21:554,290670,364,083605,577,00037,973,00016,961,536
5Dec 29, 2024 21:084,295675,075,382602,257,00042,017,00017,002,496
6Dec 29, 2024 21:554,297664,209,944597,574,00046,966,00017,055,744
7Dec 29, 2024 21:554,298668,508,010599,743,00044,980,00017,039,360
8Dec 29, 2024 21:554,299665,295,862597,904,00046,992,00016,961,536
9Dec 29, 2024 21:554,312668,898,481599,749,00046,980,00017,129,472