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 listJul 30, 2026 00:00anboto1anboto1Score: 3,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:103,054468,078,291443,139,00014,980,00016,793,600
2Jul 30, 2026 00:103,055468,586,217442,698,00015,630,00016,793,600
3Jul 30, 2026 00:103,058468,828,618443,630,00015,185,00016,793,600
4Jul 30, 2026 00:103,060469,012,004443,071,00015,955,00016,793,600
5Jul 30, 2026 00:103,061470,625,577443,984,00015,168,00016,793,600
6Jul 30, 2026 00:103,066470,015,494444,644,00015,337,00016,793,600
7Jul 30, 2026 00:103,066469,967,995444,738,00015,247,00016,793,600
8Jul 30, 2026 00:103,068470,257,943444,826,00015,453,00016,793,600
9Jul 30, 2026 00:103,069470,305,108445,259,00015,119,00016,793,600