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 listAug 23, 2026 16:29Navneet RajNavneet RajScore: 11,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:3011,4701,730,691,9371,700,280,00020,352,00016,793,600
2Aug 23, 2026 16:3011,4701,730,586,1501,699,876,00020,634,00016,793,600
3Aug 23, 2026 16:3011,4731,731,066,3991,700,143,00020,862,00016,793,600
4Aug 23, 2026 16:3011,4941,734,139,1221,704,190,00019,969,00016,793,600
5Aug 23, 2026 16:3011,4951,734,291,5521,704,897,00019,451,00016,793,600
6Aug 23, 2026 16:3011,5431,742,567,3631,711,565,00020,016,00016,793,600
7Aug 23, 2026 16:3011,5681,745,279,9471,715,864,00019,485,00016,793,600
8Aug 23, 2026 16:3011,5751,746,288,6401,716,622,00019,703,00016,793,600
9Aug 23, 2026 16:3011,6141,752,102,4911,722,695,00019,441,00016,793,600