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 13:14highload-churnerhighload-churnerScore: 1,553Success
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 13:151,548241,524,315226,960,0005,311,00016,019,456
2Oct 19, 2026 13:151,548241,789,520227,047,0005,298,00016,019,456
3Oct 19, 2026 13:151,552242,623,355227,506,0005,394,00016,019,456
4Oct 19, 2026 13:151,552242,285,487227,569,0005,307,00016,019,456
5Oct 19, 2026 13:151,553242,323,082227,661,0005,353,00016,019,456
6Oct 19, 2026 13:151,554242,513,689227,753,0005,436,00016,019,456
7Oct 19, 2026 13:151,554242,638,791227,781,0005,377,00016,019,456
8Oct 19, 2026 13:151,555242,791,541227,971,0005,409,00016,019,456
9Oct 19, 2026 13:151,555242,604,790227,905,0005,388,00016,019,456