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,273Success
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,202699,368,109630,320,985016,969,728
2Mar 7, 2024 00:354,202689,036,310630,344,229016,961,536
3Mar 7, 2024 00:354,212697,944,927631,814,364016,965,632
4Mar 7, 2024 00:354,261675,723,722602,087,00037,005,00017,068,032
5Mar 7, 2024 00:354,262670,919,818612,337,00026,970,00017,035,264
6Mar 7, 2024 00:354,262668,252,227610,384,00028,970,00017,039,360
7Mar 7, 2024 00:354,273662,459,587614,013,00027,000,00017,035,264
8Mar 7, 2024 00:354,277664,233,591605,549,00035,973,00017,072,128
9Mar 7, 2024 00:354,279665,964,514614,816,00026,991,00017,043,456
10Mar 7, 2024 00:354,285667,629,611607,742,00034,985,00017,018,880
11Mar 7, 2024 00:354,286668,219,068611,902,00030,995,00017,166,336
12Mar 7, 2024 00:354,289677,316,188613,359,00029,968,00017,014,784