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 02:40Huy Duc LeHuy Duc LeScore: 3,004Success
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 02:402,944502,018,838441,648,266016,957,440
2Mar 7, 2024 02:402,948499,355,483442,274,920016,965,632
3Mar 7, 2024 02:402,950511,542,729442,536,395016,965,632
4Mar 7, 2024 02:402,998477,970,922419,787,00029,984,00017,014,784
5Mar 7, 2024 02:403,000474,074,485424,061,00026,003,00017,027,072
6Mar 7, 2024 02:403,003475,421,716420,457,00029,961,00017,080,320
7Mar 7, 2024 02:403,004478,053,952423,660,00026,978,00017,035,264
8Mar 7, 2024 02:403,007473,790,480422,086,00029,005,00017,018,880
9Mar 7, 2024 02:403,008477,710,053418,202,00033,015,00017,035,264
10Mar 7, 2024 02:403,009484,779,969418,369,00032,950,00017,174,528
11Mar 7, 2024 02:403,009480,019,590421,406,00029,957,00017,018,880
12Mar 7, 2024 02:403,020479,397,185421,951,00030,996,00017,055,744