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 listApr 30, 2026 09:15Charles CabergsCharles CabergsScore: 3,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 09:163,814592,110,838564,109,0008,001,00017,133,568stderr
2Apr 30, 2026 09:163,814589,117,087566,182,0006,001,00016,990,208stderr
3Apr 30, 2026 09:163,815591,785,567566,326,0006,003,00017,059,840stderr
4Apr 30, 2026 09:163,815588,784,232566,275,0005,992,00017,129,472stderr
5Apr 30, 2026 09:163,815594,965,662564,370,0007,991,00017,137,664stderr
6Apr 30, 2026 09:163,817592,865,308563,694,0008,995,00017,195,008stderr
7Apr 30, 2026 09:163,819592,868,788565,853,0006,998,00017,129,472stderr
8Apr 30, 2026 09:163,820596,574,542566,050,0007,000,00017,141,760stderr
9Apr 30, 2026 09:163,838594,379,826569,848,0005,998,00017,141,760stderr