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 19, 2026 07:13highload-churnerhighload-churnerScore: 2,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 07:142,052317,268,887299,950,0007,884,00016,793,600
2Oct 19, 2026 07:142,055317,788,596300,488,0007,809,00016,793,600
3Oct 19, 2026 07:142,055317,731,151300,412,0007,898,00016,793,600
4Oct 19, 2026 07:142,055317,760,693300,568,0007,787,00016,793,600
5Oct 19, 2026 07:142,055317,683,275300,422,0007,867,00016,793,600
6Oct 19, 2026 07:142,061318,598,634301,319,0007,900,00016,793,600
7Oct 19, 2026 07:142,062318,755,229301,592,0007,815,00016,793,600
8Oct 19, 2026 07:142,062318,760,478301,536,0007,800,00016,793,600
9Oct 19, 2026 07:142,062320,366,435301,380,0007,979,00016,793,600