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 listJan 5, 2026 02:30Josu San MartinJosu San MartinScore: 3,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 02:293,477548,796,310469,641,00051,960,00016,998,400
2Jan 5, 2026 02:293,478546,052,012472,779,00048,977,00017,125,376
3Jan 5, 2026 02:293,482543,944,994476,408,00045,942,00017,104,896
4Jan 5, 2026 02:303,487551,110,189472,029,00051,003,00017,186,816
5Jan 5, 2026 02:303,493551,811,670479,935,00043,994,00017,084,416
6Jan 5, 2026 02:303,510551,345,625476,504,00049,948,00017,166,336