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 16:20Huy Duc LeHuy Duc LeScore: 3,081Success
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 16:203,037521,717,862455,551,401016,953,344
2Mar 6, 2024 16:203,042516,387,590456,260,168016,965,632
3Mar 6, 2024 16:203,043518,391,882456,457,398016,965,632
4Mar 6, 2024 16:203,077491,818,626424,636,00036,968,00017,080,320
5Mar 6, 2024 16:203,079484,548,763424,919,00036,992,00016,961,536
6Mar 6, 2024 16:203,080488,523,910431,961,00029,997,00016,949,248
7Mar 6, 2024 16:203,081485,732,551429,124,00033,009,00017,104,896
8Mar 6, 2024 16:203,082493,266,218428,308,00034,024,00017,018,880
9Mar 6, 2024 16:203,084490,552,686428,617,00033,969,00017,158,144
10Mar 6, 2024 16:203,091492,754,260428,640,00034,970,00016,982,016
11Mar 6, 2024 16:203,093487,690,026437,943,00025,996,00017,018,880
12Mar 6, 2024 16:203,100488,204,085435,002,00030,000,00017,010,688