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 24, 2023 16:07Yuriy LyfenkoYuriy LyfenkoScore: 4,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 16:074,276718,184,210641,374,213016,941,056
2Mar 24, 2023 16:074,299707,741,794644,867,995016,936,960
3Mar 24, 2023 16:074,299713,640,328644,889,113016,945,152
4Mar 24, 2023 16:074,373675,313,214633,007,00022,964,00017,010,688
5Mar 24, 2023 16:074,390693,582,443634,604,00023,947,00017,076,224
6Mar 24, 2023 16:074,445692,193,613643,752,00022,991,00016,957,440
7Mar 24, 2023 16:074,482694,780,741648,335,00023,975,00017,149,952
8Mar 24, 2023 16:074,559715,367,714661,788,00021,992,00016,957,440
9Mar 24, 2023 16:074,575708,546,967661,303,00024,973,00016,973,824
10Mar 24, 2023 16:074,592716,699,471661,815,00026,951,00017,190,912
11Mar 24, 2023 16:074,611717,695,867665,748,00025,951,00016,953,344
12Mar 24, 2023 16:074,661728,907,917672,190,00026,967,00017,199,104