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 13, 2026 00:22highload-churnerhighload-churnerScore: 2,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 00:232,150331,673,175308,355,00014,289,00016,793,600
2Oct 13, 2026 00:232,151331,660,664308,425,00014,235,00016,793,600
3Oct 13, 2026 00:232,153332,114,195308,773,00014,312,00016,793,600
4Oct 13, 2026 00:232,153332,049,268308,675,00014,351,00016,793,600
5Oct 13, 2026 00:232,154332,245,640308,772,00014,393,00016,793,600
6Oct 13, 2026 00:232,155332,601,866308,808,00014,533,00016,793,600
7Oct 13, 2026 00:232,158332,745,309309,273,00014,478,00016,793,600
8Oct 13, 2026 00:232,158332,804,474309,533,00014,249,00016,793,600
9Oct 13, 2026 00:232,160333,871,693309,699,00014,450,00016,793,600