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 listMar 6, 2024 06:53Huy Duc LeHuy Duc LeScore: 3,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 06:533,249516,259,695442,285,00045,029,00017,002,496
2Mar 6, 2024 06:533,249519,054,404437,453,00049,937,00016,986,112
3Mar 6, 2024 06:533,252513,392,621441,837,00045,983,00017,076,224
4Mar 6, 2024 06:533,252518,080,553443,845,00043,984,00017,190,912
5Mar 6, 2024 06:533,254518,687,432445,116,00043,011,00016,990,208
6Mar 6, 2024 06:533,254510,262,484444,158,00044,015,00017,010,688
7Mar 6, 2024 06:533,256514,936,465445,337,00043,032,00017,006,592
8Mar 6, 2024 06:533,258509,295,591442,673,00045,966,00016,986,112
9Mar 6, 2024 06:533,259516,377,044443,848,00044,984,00017,154,048
10Mar 6, 2024 06:533,390572,194,360508,460,354016,973,824
11Mar 6, 2024 06:533,391564,703,182508,628,807016,990,208
12Mar 6, 2024 06:533,427578,720,073514,040,915016,986,112