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 21, 2026 03:55e1011e1011Score: 16,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 04:0116,1442,432,494,6172,406,175,00015,496,00016,793,600
2Oct 21, 2026 04:0116,1462,432,821,8742,406,311,00015,664,00016,793,600
3Oct 21, 2026 04:0116,1572,434,385,6102,407,355,00016,197,00016,793,600
4Oct 21, 2026 04:0116,1582,434,641,6772,407,698,00016,106,00016,793,600
5Oct 21, 2026 04:0116,1632,435,364,3072,408,479,00016,069,00016,793,600
6Oct 21, 2026 04:0116,1652,444,828,7132,408,451,00016,431,00016,793,600
7Oct 21, 2026 04:0116,1652,435,660,2302,408,518,00016,272,00016,793,600
8Oct 21, 2026 04:0116,1712,436,603,7972,409,533,00016,205,00016,793,600
9Oct 21, 2026 04:0116,2222,444,104,2982,417,702,00015,604,00016,793,600