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 14:06Navneet RajNavneet RajScore: 4,017Success
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 14:074,010611,473,322592,585,0008,921,00016,793,600
2Aug 24, 2026 14:074,013611,993,057593,145,0008,908,00016,793,600
3Aug 24, 2026 14:074,013611,919,711593,068,0008,921,00016,793,600
4Aug 24, 2026 14:074,015612,214,920593,369,0008,916,00016,793,600
5Aug 24, 2026 14:074,017612,494,375593,759,0008,869,00016,793,600
6Aug 24, 2026 14:074,018613,822,720593,867,0008,877,00016,793,600
7Aug 24, 2026 14:074,019612,856,919593,951,0009,001,00016,793,600
8Aug 24, 2026 14:074,019612,862,840593,929,0008,954,00016,793,600
9Aug 24, 2026 14:074,022613,373,203594,471,0008,960,00016,793,600