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:07Bernard TeoBernard TeoScore: 11,938Success
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:0311,8001,830,968,7251,770,069,758016,982,016
2Apr 9, 2023 18:0311,9071,852,735,3231,785,976,648016,900,096
3Apr 9, 2023 18:0711,9231,844,156,9861,788,408,928016,891,904
4Apr 9, 2023 18:0311,9381,850,386,5891,790,654,208016,904,192
5Apr 9, 2023 18:0711,9411,872,405,5931,791,220,129016,896,000
6Apr 9, 2023 18:0711,9601,859,321,6791,793,952,645016,900,096