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 16:11Navneet RajNavneet RajScore: 3,841Success
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 16:113,839585,680,654573,816,0002,062,00016,793,600
2Aug 24, 2026 16:113,840585,892,171573,999,0002,112,00016,793,600
3Aug 24, 2026 16:113,840585,896,641573,915,0002,143,00016,793,600
4Aug 24, 2026 16:113,841586,129,230574,195,0002,024,00016,793,600
5Aug 24, 2026 16:113,841586,011,834574,140,0002,052,00016,793,600
6Aug 24, 2026 16:113,841586,929,825574,139,0002,110,00016,793,600
7Aug 24, 2026 16:113,841586,085,795574,099,0002,103,00016,793,600
8Aug 24, 2026 16:113,843586,295,348574,424,0002,074,00016,793,600
9Aug 24, 2026 16:113,844586,561,834574,669,0002,073,00016,793,600