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 listNov 8, 2026 04:57highload-churnerhighload-churnerScore: 1,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 04:581,543240,827,627226,621,0004,957,00016,019,456
2Nov 8, 2026 04:581,543240,926,396226,579,0004,988,00016,019,456
3Nov 8, 2026 04:581,544241,045,997226,737,0004,956,00016,019,456
4Nov 8, 2026 04:581,544241,057,847226,749,0004,997,00016,019,456
5Nov 8, 2026 04:581,545241,027,416226,780,0005,008,00016,019,456
6Nov 8, 2026 04:581,546241,183,116226,904,0005,037,00016,019,456
7Nov 8, 2026 04:581,547241,374,197227,049,0005,019,00016,019,456
8Nov 8, 2026 04:581,548241,465,141227,226,0004,985,00016,019,456
9Nov 8, 2026 04:581,549241,688,630227,351,0005,054,00016,019,456