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 09:20anboto1anboto1Error
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 09:2003,689,292,2283,658,610,00021,104,00016,793,600pos 2: expected 232 got 45
2Jun 24, 2026 09:2002,611,919,4522,581,979,00020,621,00016,793,600pos 2: expected 242 got 103
3Jun 24, 2026 09:2002,499,285,2042,469,808,00020,194,00016,793,600pos 2: expected 252 got 11