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 listApr 1, 2025 20:47Aniruddha DebAniruddha DebScore: 59,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2025 20:4758,9718,885,688,3118,841,653,0003,991,00016,953,344
2Apr 1, 2025 20:4759,0898,905,181,1978,858,323,0004,990,00017,121,280
3Apr 1, 2025 20:4759,1058,903,510,6218,861,725,0003,992,00016,953,344
4Apr 1, 2025 20:4759,1318,908,474,7378,864,687,0004,990,00016,953,344
5Apr 1, 2025 20:4759,1328,909,250,4068,866,752,0002,994,00017,121,280
6Apr 1, 2025 20:4759,2138,922,157,7078,880,028,0001,996,00016,953,344
7Apr 1, 2025 20:4759,2308,929,374,3968,877,481,0006,986,00016,953,344
8Apr 1, 2025 20:4759,3268,940,085,8738,896,879,0001,995,00016,953,344
9Apr 1, 2025 20:4759,3688,947,184,5308,898,151,0006,986,00016,953,344