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 16:01anboto1anboto1Score: 2,950Success
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 16:022,935449,534,838432,929,0007,439,00016,793,600
2Jun 24, 2026 16:022,938450,012,736433,302,0007,521,00016,793,600
3Jun 24, 2026 16:022,941450,399,110433,703,0007,534,00016,793,600
4Jun 24, 2026 16:022,945451,025,263434,315,0007,556,00016,793,600
5Jun 24, 2026 16:022,950451,611,606435,167,0007,399,00016,793,600
6Jun 24, 2026 16:022,950451,980,452434,868,0007,730,00016,793,600
7Jun 24, 2026 16:022,955452,576,601435,484,0007,826,00016,793,600
8Jun 24, 2026 16:022,956452,837,546435,888,0007,633,00016,793,600
9Jun 24, 2026 16:023,233494,387,949477,553,0007,510,00016,793,600