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:52highload-churnerhighload-churnerScore: 2,121Success
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:532,119326,950,811307,430,00010,523,00016,793,600
2Oct 13, 2026 00:532,120327,187,961307,624,00010,495,00016,793,600
3Oct 13, 2026 00:532,121327,203,749306,826,00011,427,00016,793,600
4Oct 13, 2026 00:532,121329,098,837307,647,00010,549,00016,793,600
5Oct 13, 2026 00:532,121327,321,952307,777,00010,500,00016,793,600
6Oct 13, 2026 00:532,123327,454,301307,962,00010,528,00016,793,600
7Oct 13, 2026 00:532,126328,466,826307,511,00011,479,00016,793,600
8Oct 13, 2026 00:532,130328,532,628308,961,00010,602,00016,793,600
9Oct 13, 2026 00:532,131328,798,000308,022,00011,724,00016,793,600