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 09:45Alexander MonakovAlexander MonakovScore: 4,154Success
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 09:454,141642,713,751604,127,00017,003,00017,100,800
2Mar 25, 2023 09:454,142651,687,492611,342,00010,005,00017,199,104
3Mar 25, 2023 09:454,144640,511,965602,639,00018,988,00017,096,704
4Mar 25, 2023 09:454,145648,587,776603,755,00017,992,00017,092,608
5Mar 25, 2023 09:454,145647,654,189606,799,00014,995,00017,096,704
6Mar 25, 2023 09:454,146647,424,678604,904,00016,997,00017,047,552
7Mar 25, 2023 09:454,154648,158,538607,067,00016,001,00017,182,720
8Mar 25, 2023 09:454,159699,923,134623,804,574017,006,592
9Mar 25, 2023 09:454,184689,680,389627,533,137017,006,592
10Mar 25, 2023 09:454,184651,943,359612,567,00014,989,00017,027,072
11Mar 25, 2023 09:454,262698,963,613639,280,149017,010,688
12Mar 25, 2023 09:454,300670,611,727630,057,00015,001,00017,096,704