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 12, 2026 07:52Victor MerckléVictor MerckléScore: 1,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 07:531,678261,604,515244,176,0007,654,00016,797,696
2Jun 12, 2026 07:531,678261,025,202244,065,0007,744,00016,797,696
3Jun 12, 2026 07:531,679261,041,836244,071,0007,865,00016,797,696
4Jun 12, 2026 07:531,680261,604,978244,225,0007,830,00016,797,696
5Jun 12, 2026 07:531,680263,056,358244,102,0007,919,00016,797,696
6Jun 12, 2026 07:531,681263,259,726244,379,0007,796,00016,797,696
7Jun 12, 2026 07:531,682262,136,009244,677,0007,732,00016,797,696
8Jun 12, 2026 07:531,686262,198,698245,187,0007,799,00016,797,696
9Jun 12, 2026 07:531,686262,525,747245,120,0007,826,00016,797,696