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 26, 2023 10:51Alexander MonakovAlexander MonakovScore: 3,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 10:513,963646,504,117594,427,480017,002,496
2Mar 26, 2023 10:513,974670,244,612596,132,805017,006,592
3Mar 26, 2023 10:513,985655,662,558597,707,200017,010,688
4Mar 26, 2023 10:513,995619,415,965581,225,00018,006,00017,022,976
5Mar 26, 2023 10:513,997630,232,512583,562,00015,988,00017,100,800
6Mar 26, 2023 10:513,997623,150,979581,633,00017,988,00017,100,800
7Mar 26, 2023 10:513,998620,323,525582,653,00016,989,00017,096,704
8Mar 26, 2023 10:513,998618,801,728577,675,00021,987,00016,965,632
9Mar 26, 2023 10:513,998619,786,684583,748,00015,993,00017,100,800
10Mar 26, 2023 10:513,999619,283,412582,835,00016,995,00017,178,624
11Mar 26, 2023 10:513,999623,952,368580,847,00018,995,00017,166,336
12Mar 26, 2023 10:514,002631,338,989587,287,00013,006,00017,100,800