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 11:40anboto1anboto1Score: 4,341Success
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 11:404,322657,809,194624,254,00024,131,00016,793,600
2Jun 24, 2026 11:404,336659,514,517626,678,00023,745,00016,793,600
3Jun 24, 2026 11:404,338659,900,259627,521,00023,267,00016,793,600
4Jun 24, 2026 11:404,340660,214,886627,758,00023,321,00016,793,600
5Jun 24, 2026 11:404,341660,347,719628,016,00023,195,00016,793,600
6Jun 24, 2026 11:404,341660,359,094627,506,00023,664,00016,793,600
7Jun 24, 2026 11:404,342660,547,117627,485,00023,903,00016,793,600
8Jun 24, 2026 11:404,344660,756,952627,530,00024,109,00016,793,600
9Jun 24, 2026 11:404,346661,080,875627,669,00024,256,00016,793,600