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 9, 2023 18:25Bernard TeoBernard TeoScore: 12,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 18:2411,7351,825,432,1611,760,176,016016,896,000
2Apr 9, 2023 18:2411,7681,825,265,1181,765,135,823017,022,976
3Apr 9, 2023 18:4111,7821,829,781,5381,767,313,689016,896,000
4Apr 9, 2023 18:4111,7841,836,368,3401,767,651,435016,896,000
5Apr 9, 2023 18:4111,8491,847,490,2391,777,294,304016,900,096
6Apr 9, 2023 18:2512,5531,949,974,5931,882,901,197016,896,000
7Apr 9, 2023 18:2512,5891,964,485,0271,888,321,496017,022,976
8Apr 9, 2023 18:2512,6071,962,407,4071,890,994,089016,908,288
9Apr 9, 2023 18:2512,6081,959,922,5341,891,243,005016,908,288
10Apr 9, 2023 18:2512,6271,948,037,5101,894,109,804016,896,000
11Apr 9, 2023 18:2512,6531,961,549,7921,897,883,510016,900,096
12Apr 9, 2023 18:2412,7071,968,444,1041,906,049,755016,904,192