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:57Joad NacerJoad NacerScore: 4,190Success
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:574,180654,128,195585,013,00042,000,00016,957,440
2Dec 28, 2024 01:574,183659,836,961582,528,00044,963,00017,043,456
3Dec 28, 2024 01:574,187649,890,265582,002,00046,000,00017,178,624
4Dec 28, 2024 01:574,188651,006,072586,170,00042,012,00017,051,648
5Dec 28, 2024 01:574,190652,076,874586,567,00041,969,00017,154,048
6Dec 28, 2024 01:574,190657,734,362581,580,00046,966,00017,055,744
7Dec 28, 2024 01:574,191652,311,463584,669,00043,975,00017,047,552
8Dec 28, 2024 01:574,193651,386,046582,017,00047,001,00016,957,440
9Dec 28, 2024 01:574,195658,510,670584,188,00045,014,00017,076,224