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 listOct 9, 2026 15:40Karthik ReddyKarthik ReddyScore: 1,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 16:181,558242,469,209229,522,0004,230,00016,793,600
2Oct 9, 2026 16:181,559242,421,432229,678,0004,222,00016,793,600
3Oct 9, 2026 16:181,559242,522,302229,701,0004,229,00016,793,600
4Oct 9, 2026 16:181,559242,595,675229,684,0004,260,00016,793,600
5Oct 9, 2026 16:181,560242,747,568229,816,0004,250,00016,793,600
6Oct 9, 2026 16:181,560242,662,642229,749,0004,252,00016,793,600
7Oct 9, 2026 16:181,560242,572,550229,783,0004,247,00016,793,600
8Oct 9, 2026 16:181,561243,076,369230,002,0004,254,00016,793,600
9Oct 9, 2026 16:181,562243,053,290230,048,0004,285,00016,793,600