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 21, 2023 06:03Alexander MonakovAlexander MonakovScore: 4,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2023 06:034,278706,153,954641,643,235016,904,192
2Mar 21, 2023 06:034,279709,723,092641,871,654016,912,384
3Mar 21, 2023 06:034,284725,693,065642,540,850016,900,096
4Mar 21, 2023 06:034,350675,845,222625,583,00026,982,00016,949,248
5Mar 21, 2023 06:034,356679,899,844624,376,00028,971,00017,182,720
6Mar 21, 2023 06:034,357676,369,569625,639,00027,983,00017,178,624
7Mar 21, 2023 06:034,358677,631,300621,680,00031,983,00017,088,512
8Mar 21, 2023 06:034,361681,583,956623,168,00031,008,00016,941,056
9Mar 21, 2023 06:034,363677,460,942624,450,00029,973,00017,186,816
10Mar 21, 2023 06:034,363684,896,694620,514,00033,973,00016,969,728
11Mar 21, 2023 06:034,446690,612,557634,912,00031,995,00017,006,592
12Mar 21, 2023 06:034,483692,337,838643,542,00028,979,00017,178,624