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 24, 2026 15:14Navneet RajNavneet RajScore: 4,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 15:144,073620,894,365602,028,0008,979,00016,793,600
2Aug 24, 2026 15:144,080622,018,123603,043,0009,043,00016,793,600
3Aug 24, 2026 15:144,080623,197,476603,102,0009,025,00016,793,600
4Aug 24, 2026 15:144,082622,309,724603,437,0008,983,00016,793,600
5Aug 24, 2026 15:144,083622,451,315603,513,0009,052,00016,793,600
6Aug 24, 2026 15:144,084622,636,479603,760,0008,987,00016,793,600
7Aug 24, 2026 15:144,085622,703,153603,723,0009,072,00016,793,600
8Aug 24, 2026 15:144,086622,846,311603,733,0009,203,00016,793,600
9Aug 24, 2026 15:144,089623,482,787604,473,0009,012,00016,793,600