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: 3,422Success
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:413,416521,726,217487,252,00025,250,00016,793,600
2Jun 24, 2026 11:413,419522,313,416487,174,00025,730,00016,793,600
3Jun 24, 2026 11:413,421522,345,269488,162,00024,997,00016,793,600
4Jun 24, 2026 11:413,421522,425,417487,986,00025,286,00016,793,600
5Jun 24, 2026 11:413,422522,701,441487,448,00025,940,00016,793,600
6Jun 24, 2026 11:413,426523,079,726488,875,00025,123,00016,793,600
7Jun 24, 2026 11:413,431523,969,851489,388,00025,375,00016,793,600
8Jun 24, 2026 11:413,440525,236,910490,721,00025,393,00016,793,600
9Jun 24, 2026 11:413,442525,452,601491,161,00025,227,00016,793,600