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 7, 2024 00:35Huy Duc LeHuy Duc LeScore: 4,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 00:354,292703,654,335643,822,242016,961,536
2Mar 7, 2024 00:354,295704,851,161644,181,159016,953,344
3Mar 7, 2024 00:354,299704,699,019644,805,571016,965,632
4Mar 7, 2024 00:354,331672,597,169623,669,00025,986,00017,170,432
5Mar 7, 2024 00:354,337672,560,217623,514,00026,979,00017,207,296
6Mar 7, 2024 00:354,338676,590,123615,737,00034,985,00017,027,072
7Mar 7, 2024 00:354,339675,269,186612,804,00037,987,00017,018,880
8Mar 7, 2024 00:354,342674,733,316622,366,00028,970,00017,010,688
9Mar 7, 2024 00:354,343679,514,827627,499,00023,980,00017,186,816
10Mar 7, 2024 00:354,343680,461,842627,524,00023,981,00017,014,784
11Mar 7, 2024 00:354,348677,361,862619,119,00033,006,00017,080,320
12Mar 7, 2024 00:354,349681,903,529619,405,00032,968,00017,002,496