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 listDec 19, 2023 10:56Oleg KovalovOleg KovalovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2023 09:2500000Error: pos 0: expected 251 got 226
2Dec 19, 2023 10:0800000Error: pos 0: expected 54 got 143
3Dec 19, 2023 10:1900000Error: pos 0: expected 175 got 200
4Dec 19, 2023 10:3800000Error: pos 0: expected 97 got 55
5Dec 19, 2023 10:4300000Error: pos 0: expected 200 got 130
6Dec 19, 2023 10:5100000Error: pos 0: expected 218 got 149
7Dec 19, 2023 11:0514,1522,185,496,2812,122,784,160016,932,864
8Dec 19, 2023 11:0514,1582,187,451,5202,123,742,223016,936,960
9Dec 19, 2023 11:0414,9772,306,254,6592,246,547,463016,949,248
10Dec 19, 2023 11:0414,9852,307,511,9102,247,820,465016,949,248
11Dec 19, 2023 10:5615,0262,317,236,1982,253,896,290016,941,056
12Dec 19, 2023 10:5615,0772,334,376,9952,261,509,935016,936,960
13Dec 19, 2023 11:0415,1092,329,543,9082,266,296,849016,941,056
14Dec 19, 2023 11:0515,1852,342,605,8492,277,710,584016,945,152
15Dec 19, 2023 10:5615,8682,432,676,4872,380,182,659016,945,152