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 12:19highload-churnerhighload-churnerScore: 1,616Success
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 12:191,611251,127,891234,022,0007,691,00016,793,600
2Oct 19, 2026 12:191,614251,525,386234,474,0007,668,00016,793,600
3Oct 19, 2026 12:191,614251,601,848234,540,0007,667,00016,793,600
4Oct 19, 2026 12:191,615251,822,929234,757,0007,626,00016,793,600
5Oct 19, 2026 12:191,616251,860,611234,840,0007,622,00016,793,600
6Oct 19, 2026 12:191,617252,138,316235,054,0007,637,00016,793,600
7Oct 19, 2026 12:191,617251,974,568235,012,0007,640,00016,793,600
8Oct 19, 2026 12:191,617252,110,028234,952,0007,737,00016,793,600
9Oct 19, 2026 12:191,621252,511,753235,438,0007,725,00016,793,600