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 20:47anboto1anboto1Score: 3,383Success
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 20:483,378516,806,981482,088,00024,724,00016,793,600
2Jul 29, 2026 20:483,379516,971,589481,497,00025,451,00016,793,600
3Jul 29, 2026 20:483,380517,159,801482,371,00024,770,00016,793,600
4Jul 29, 2026 20:483,381517,284,330481,247,00025,943,00016,793,600
5Jul 29, 2026 20:483,383517,436,616482,342,00025,188,00016,793,600
6Jul 29, 2026 20:483,385518,437,027482,352,00025,526,00016,793,600
7Jul 29, 2026 20:483,388518,304,601483,301,00024,985,00016,793,600
8Jul 29, 2026 20:483,399520,579,303484,600,00025,382,00016,793,600
9Jul 29, 2026 20:483,400520,071,808484,679,00025,465,00016,793,600