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 listJul 29, 2026 17:54anboto1anboto1Score: 2,992Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 17:542,983457,613,644434,424,00013,118,00016,793,600
2Jul 29, 2026 17:542,987458,102,507434,891,00013,186,00016,793,600
3Jul 29, 2026 17:542,988459,056,234435,154,00013,181,00016,793,600
4Jul 29, 2026 17:542,990459,887,954435,257,00013,252,00016,793,600
5Jul 29, 2026 17:542,992459,014,502435,611,00013,211,00016,793,600
6Jul 29, 2026 17:542,993459,050,383435,827,00013,169,00016,797,696
7Jul 29, 2026 17:542,999459,812,502436,655,00013,200,00016,793,600
8Jul 29, 2026 17:543,001460,412,376436,838,00013,440,00016,793,600
9Jul 29, 2026 17:543,043466,476,490443,054,00013,425,00016,793,600