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 listFeb 20, 2023 02:09LiamLiamScore: 41,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2023 02:0931,9894,861,496,9634,798,351,433016,949,248
2Feb 20, 2023 02:0932,0064,869,762,7074,800,938,892016,945,152
3Feb 20, 2023 02:0932,0214,865,296,9184,803,143,129016,945,152
4Feb 20, 2023 02:0941,1786,240,710,8406,176,729,228016,924,672
5Feb 20, 2023 02:0941,2406,250,625,3916,185,974,347016,949,248
6Feb 20, 2023 02:0941,3216,261,631,4246,198,207,305016,953,344