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 17:13Navneet RajNavneet RajScore: 21,875Success
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 17:1521,7663,274,851,8793,252,373,00012,550,00016,793,600
2Aug 23, 2026 17:1521,7683,275,424,2933,252,676,00012,592,00016,793,600
3Aug 23, 2026 17:1521,7843,277,610,0823,255,301,00012,330,00016,793,600
4Aug 23, 2026 17:1521,8633,289,600,2713,267,042,00012,492,00016,793,600
5Aug 23, 2026 17:1521,8753,291,241,8113,268,862,00012,437,00016,793,600
6Aug 23, 2026 17:1521,9883,308,147,2763,285,865,00012,390,00016,793,600
7Aug 23, 2026 17:1522,0523,317,915,8453,295,386,00012,551,00016,793,600
8Aug 23, 2026 17:1522,0603,318,943,4303,296,523,00012,477,00016,793,600
9Aug 23, 2026 17:1522,1403,331,029,4073,308,137,00012,887,00016,793,600