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 listApr 19, 2023 03:29Yuriy LyfenkoYuriy LyfenkoScore: 3,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2023 03:293,924654,978,029588,564,007016,936,960
2Apr 19, 2023 03:293,925652,127,327588,789,582016,936,960
3Apr 19, 2023 03:293,927654,905,312589,082,374016,941,056
4Apr 19, 2023 03:293,941614,363,429562,079,00029,004,00017,068,032
5Apr 19, 2023 03:293,941615,161,096566,207,00025,009,00016,957,440
6Apr 19, 2023 03:293,943615,236,878564,529,00026,977,00016,961,536
7Apr 19, 2023 03:293,944614,881,842566,601,00024,982,00016,961,536
8Apr 19, 2023 03:293,944622,663,106565,612,00025,982,00016,957,440
9Apr 19, 2023 03:293,945620,005,478561,720,00029,985,00017,092,608
10Apr 19, 2023 03:293,945615,673,490568,764,00022,990,00016,961,536
11Apr 19, 2023 03:293,946617,267,918564,848,00026,992,00016,957,440
12Apr 19, 2023 03:293,947619,576,555567,089,00025,003,00016,957,440