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 29, 2026 22:38anboto1anboto1Score: 3,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 22:393,353513,025,704478,178,00024,883,00016,793,600
2Jul 29, 2026 22:393,378516,839,429482,116,00024,677,00016,793,600
3Jul 29, 2026 22:393,382517,291,409482,971,00024,460,00016,793,600
4Jul 29, 2026 22:393,384517,681,927482,229,00025,515,00016,793,600
5Jul 29, 2026 22:393,396519,388,502483,960,00025,506,00016,793,600
6Jul 29, 2026 22:393,399519,806,504484,333,00025,539,00016,793,600
7Jul 29, 2026 22:393,406520,878,842485,152,00025,818,00016,793,600
8Jul 29, 2026 22:393,420522,964,263487,829,00025,268,00016,793,600
9Jul 29, 2026 22:393,435525,382,554489,538,00025,763,00016,793,600