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 listOct 7, 2026 20:18Karthik ReddyKarthik ReddyScore: 1,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 20:181,552242,020,220228,680,0004,239,00016,793,600
2Oct 7, 2026 20:181,552241,893,820228,672,0004,209,00016,793,600
3Oct 7, 2026 20:181,553242,013,519228,766,0004,243,00016,793,600
4Oct 7, 2026 20:181,554242,108,837228,827,0004,314,00016,793,600
5Oct 7, 2026 20:181,555243,092,106229,129,0004,243,00016,793,600
6Oct 7, 2026 20:181,557242,729,645229,348,0004,270,00016,793,600
7Oct 7, 2026 20:181,560243,006,601229,765,0004,292,00016,793,600
8Oct 7, 2026 20:181,570244,660,680231,316,0004,259,00016,793,600
9Oct 7, 2026 20:181,589247,459,561234,192,0004,255,00016,793,600