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 26, 2023 11:54Alexander MonakovAlexander MonakovScore: 3,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 11:543,921650,305,581588,209,706016,982,016
2Mar 26, 2023 11:543,934613,165,640582,157,0008,002,00017,072,128
3Mar 26, 2023 11:543,936653,494,532590,435,457016,982,016
4Mar 26, 2023 11:543,936616,310,513581,322,0009,005,00016,957,440
5Mar 26, 2023 11:543,936615,792,035584,368,0006,003,00016,990,208
6Mar 26, 2023 11:543,937620,136,134584,570,0005,995,00017,080,320
7Mar 26, 2023 11:543,940655,786,132590,959,818016,982,016
8Mar 26, 2023 11:543,940617,754,976577,026,00014,000,00017,092,608
9Mar 26, 2023 11:543,941611,380,083579,135,00012,002,00017,035,264
10Mar 26, 2023 11:543,943619,633,426580,523,00010,990,00016,990,208
11Mar 26, 2023 11:543,945617,568,823586,703,0004,997,00017,002,496
12Mar 26, 2023 11:543,956620,792,538583,480,0009,991,00017,076,224