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 22:13anboto1anboto1Score: 3,887Success
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 22:143,858588,741,784556,428,00022,281,00016,793,600
2Jul 29, 2026 22:143,867590,074,922557,999,00022,188,00016,793,600
3Jul 29, 2026 22:143,876591,931,861559,488,00021,921,00016,793,600
4Jul 29, 2026 22:143,881592,837,923560,049,00022,129,00016,793,600
5Jul 29, 2026 22:143,887593,274,058560,755,00022,358,00016,793,600
6Jul 29, 2026 22:143,891593,749,670561,437,00022,248,00016,793,600
7Jul 29, 2026 22:143,897594,585,900562,440,00022,112,00016,793,600
8Jul 29, 2026 22:143,904595,772,121563,692,00022,045,00016,793,600
9Jul 29, 2026 22:143,934609,968,731567,859,00022,242,00016,793,600