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 9, 2026 15:23highload-churnerhighload-churnerScore: 3,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 15:553,323507,533,950473,185,00025,333,00016,797,696
2Oct 9, 2026 15:553,331508,716,878474,339,00025,317,00016,797,696
3Oct 9, 2026 15:553,335509,221,355474,790,00025,465,00016,797,696