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 listOct 3, 2024 18:26Joad NacerJoad NacerScore: 4,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 20:024,330677,572,625606,511,00042,965,00017,084,416
2Dec 12, 2024 20:024,333670,515,796604,953,00044,996,00016,957,440
3Dec 12, 2024 20:024,335677,212,451613,227,00037,013,00017,018,880
4Dec 12, 2024 20:024,338671,615,397608,652,00041,976,00017,014,784
5Dec 12, 2024 20:024,339670,878,976602,825,00047,986,00017,047,552
6Dec 12, 2024 20:024,339672,284,924606,927,00043,994,00016,949,248
7Dec 12, 2024 20:024,342672,861,497607,376,00043,954,00017,211,392
8Oct 3, 2024 18:264,343680,056,685606,528,00044,965,00017,043,456
9Dec 12, 2024 20:024,345676,579,132613,758,00037,985,00016,949,248
10Dec 12, 2024 20:024,346679,426,145610,874,00040,991,00016,994,304
11Oct 3, 2024 18:264,349676,828,057607,296,00045,021,00016,969,728
12Oct 3, 2024 18:264,355676,093,819613,285,00040,018,00017,047,552