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:57anboto1anboto1Score: 3,231Success
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:573,219492,144,807458,323,00024,604,00016,793,600
2Jun 24, 2026 11:573,224492,795,851459,008,00024,595,00016,793,600
3Jun 24, 2026 11:573,227493,343,465458,947,00025,182,00016,793,600
4Jun 24, 2026 11:573,230493,864,976458,926,00025,646,00016,793,600
5Jun 24, 2026 11:573,231493,899,273459,441,00025,258,00016,793,600
6Jun 24, 2026 11:573,235494,529,513458,934,00026,380,00016,793,600
7Jun 24, 2026 11:573,241495,383,556462,030,00024,227,00016,793,600
8Jun 24, 2026 11:573,242495,604,246462,049,00024,374,00016,793,600
9Jun 24, 2026 11:573,249496,946,851461,862,00025,624,00016,793,600