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:15anboto1anboto1Score: 2,922Success
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:152,921447,478,224431,368,0006,857,00016,793,600
2Jun 24, 2026 16:152,921447,377,889431,359,0006,898,00016,793,600
3Jun 24, 2026 16:152,921448,039,150431,299,0006,889,00016,793,600
4Jun 24, 2026 16:152,921447,379,614431,335,0006,915,00016,793,600
5Jun 24, 2026 16:152,922447,567,352431,533,0006,901,00016,793,600
6Jun 24, 2026 16:152,922447,656,267431,323,0007,041,00016,793,600
7Jun 24, 2026 16:152,926450,102,797432,089,0006,901,00016,793,600
8Jun 24, 2026 16:152,926448,088,708432,061,0006,945,00016,793,600
9Jun 24, 2026 16:152,927448,516,963432,202,0006,980,00016,793,600