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 listJun 24, 2026 12:53anboto1anboto1Score: 3,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 12:543,100474,272,396439,759,00025,369,00016,793,600
2Jun 24, 2026 12:543,103475,363,029439,949,00025,577,00016,793,600
3Jun 24, 2026 12:543,110475,668,661441,777,00024,806,00016,793,600
4Jun 24, 2026 12:543,112476,208,506440,234,00026,577,00016,793,600
5Jun 24, 2026 12:543,114476,379,805441,783,00025,439,00016,793,600
6Jun 24, 2026 12:543,114476,293,519441,497,00025,686,00016,793,600
7Jun 24, 2026 12:543,119476,901,448441,983,00025,867,00016,793,600
8Jun 24, 2026 12:543,126478,041,946443,433,00025,489,00016,793,600
9Jun 24, 2026 12:543,127478,137,332442,947,00026,138,00016,793,600