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 19, 2023 19:41Robert BurkeRobert BurkeScore: 4,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2023 19:414,389685,072,291634,415,00023,977,00016,982,016
2Mar 19, 2023 19:414,391684,979,624635,720,00022,989,00017,027,072
3Mar 19, 2023 19:414,394687,110,526637,094,00022,003,00016,957,440
4Mar 19, 2023 19:414,397682,399,227635,564,00023,983,00017,080,320
5Mar 19, 2023 19:414,398682,942,225636,761,00022,991,00017,027,072
6Mar 19, 2023 19:414,404683,531,657637,603,00022,985,00017,129,472
7Mar 19, 2023 19:414,410684,815,140639,561,00021,984,00017,047,552
8Mar 19, 2023 19:414,414693,811,725639,082,00023,002,00017,047,552
9Mar 19, 2023 19:414,422690,599,166641,330,00021,977,00017,022,976
10Mar 19, 2023 19:414,425722,514,576663,695,728017,002,496
11Mar 19, 2023 19:414,427724,170,726664,038,237016,998,400
12Mar 19, 2023 19:414,435727,642,119665,205,346016,990,208