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 25, 2023 08:20Alexander MonakovAlexander MonakovScore: 4,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 08:204,184691,330,884627,576,764016,998,400
2Mar 25, 2023 08:204,190650,279,777606,581,00021,984,00017,096,704
3Mar 25, 2023 08:204,191651,411,476615,644,00012,992,00017,059,840
4Mar 25, 2023 08:204,191652,484,713611,716,00016,992,00017,190,912
5Mar 25, 2023 08:204,192651,669,949609,741,00018,991,00017,117,184
6Mar 25, 2023 08:204,194701,158,408629,115,572016,994,304
7Mar 25, 2023 08:204,197649,025,205612,578,00016,988,00017,084,416
8Mar 25, 2023 08:204,206651,821,436614,971,00015,999,00017,092,608
9Mar 25, 2023 08:204,333718,750,414650,018,538017,006,592
10Mar 25, 2023 08:204,343677,443,388637,498,00013,988,00017,096,704
11Mar 25, 2023 08:204,345675,506,693636,783,00014,994,00017,059,840
12Mar 25, 2023 08:204,356683,777,248637,423,00015,985,00017,154,048