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 listJun 24, 2026 10:58anboto1anboto1Score: 4,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:594,366664,223,915626,851,00028,132,00016,793,600
2Jun 24, 2026 10:594,399669,191,213630,733,00029,230,00016,793,600
3Jun 24, 2026 10:594,420672,249,210633,680,00029,391,00016,793,600
4Jun 24, 2026 10:594,422672,581,674633,797,00029,542,00016,793,600
5Jun 24, 2026 10:594,432674,184,953636,504,00028,428,00016,793,600
6Jun 24, 2026 10:594,435674,495,305635,917,00029,381,00016,793,600
7Jun 24, 2026 10:594,435674,617,982635,449,00029,930,00016,793,600
8Jun 24, 2026 10:594,436674,622,264635,620,00029,834,00016,793,600
9Jun 24, 2026 10:594,436674,568,191635,639,00029,817,00016,793,600