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:16anboto1anboto1Score: 4,668Success
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:174,645705,908,265671,484,00025,288,00016,793,600
2Jun 24, 2026 11:174,649706,539,493672,630,00024,823,00016,793,600
3Jun 24, 2026 11:174,657707,765,139673,204,00025,404,00016,793,600
4Jun 24, 2026 11:174,663708,829,623674,132,00025,381,00016,793,600
5Jun 24, 2026 11:174,668709,517,540675,421,00024,843,00016,793,600
6Jun 24, 2026 11:174,680712,719,435676,056,00025,970,00016,793,600
7Jun 24, 2026 11:175,031763,965,264728,525,00026,261,00016,793,600
8Jun 24, 2026 11:175,046766,290,726731,234,00025,754,00016,793,600
9Jun 24, 2026 11:175,434824,270,853789,342,00025,822,00016,793,600