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 listSep 26, 2026 14:22Kevin HeaveyKevin HeaveyScore: 1,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 14:231,602250,441,795233,923,0006,389,00016,793,600
2Sep 26, 2026 14:231,602250,088,331233,895,0006,426,00016,793,600
3Sep 26, 2026 14:231,603249,818,396234,074,0006,450,00016,793,600
4Sep 26, 2026 14:231,604249,937,952234,127,0006,474,00016,793,600
5Sep 26, 2026 14:231,604249,972,624234,209,0006,431,00016,793,600
6Sep 26, 2026 14:231,604249,445,324234,110,0006,494,00016,793,600
7Sep 26, 2026 14:231,605249,663,451234,275,0006,542,00016,793,600
8Sep 26, 2026 14:231,605250,185,416234,326,0006,531,00016,793,600
9Sep 26, 2026 14:231,606249,783,349234,406,0006,494,00016,793,600