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 listOct 21, 2026 06:06e1011e1011Score: 56,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 06:1256,2098,442,387,0748,413,986,00017,386,00016,793,600
2Oct 21, 2026 06:1256,2148,443,238,3828,414,968,00017,246,00016,793,600
3Oct 21, 2026 06:1256,2168,443,393,6398,415,222,00017,229,00016,793,600
4Oct 21, 2026 06:1256,2198,444,244,4448,415,429,00017,537,00016,793,600
5Oct 21, 2026 06:1256,2198,443,724,8328,415,474,00017,379,00016,793,600
6Oct 21, 2026 06:1256,2208,443,939,1358,415,932,00017,096,00016,793,600
7Oct 21, 2026 06:1256,2328,446,144,4168,417,260,00017,616,00016,793,600
8Oct 21, 2026 06:1256,2568,449,330,6158,421,176,00017,262,00016,793,600
9Oct 21, 2026 06:1256,2588,450,201,6948,420,518,00018,282,00016,793,600