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 27, 2026 18:13Victor MerckléVictor MerckléScore: 1,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 18:191,660256,937,212241,371,0007,679,00016,797,696
2Jun 27, 2026 18:191,662257,314,679241,603,0007,792,00016,797,696
3Jun 27, 2026 18:191,662257,253,160241,540,0007,762,00016,797,696
4Jun 27, 2026 18:191,662257,208,131241,613,0007,752,00016,797,696
5Jun 27, 2026 18:191,662257,169,681241,619,0007,759,00016,797,696
6Jun 27, 2026 18:191,663257,408,606241,752,0007,812,00016,797,696
7Jun 27, 2026 18:191,666257,747,949242,122,0007,829,00016,797,696
8Jun 27, 2026 18:191,667258,651,696242,292,0007,860,00016,797,696
9Jun 27, 2026 18:191,667257,879,127242,272,0007,810,00016,797,696