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:53Robert BurkeRobert BurkeScore: 4,403Success
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:534,391680,069,723634,591,00023,984,00017,047,552
2Mar 19, 2023 19:534,393685,226,314637,998,00020,999,00017,084,416
3Mar 19, 2023 19:534,397680,119,187635,614,00023,985,00017,195,008
4Mar 19, 2023 19:534,399680,801,819633,803,00025,991,00017,145,856
5Mar 19, 2023 19:534,400686,397,740636,950,00022,998,00016,961,536
6Mar 19, 2023 19:534,400687,927,039638,068,00022,002,00017,113,088
7Mar 19, 2023 19:534,403682,412,792633,425,00026,975,00017,027,072
8Mar 19, 2023 19:534,405684,117,059635,754,00024,990,00017,084,416
9Mar 19, 2023 19:534,409683,273,083638,368,00022,977,00017,178,624
10Mar 19, 2023 19:534,429714,633,935664,350,580017,002,496
11Mar 19, 2023 19:534,440727,622,019666,064,860017,006,592
12Mar 19, 2023 19:534,471727,834,777670,632,649016,990,208