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 listApr 28, 2026 02:09Charles CabergsCharles CabergsScore: 3,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 02:093,828591,711,557565,248,0009,003,00017,096,704
2Apr 28, 2026 02:093,830593,756,410566,621,0007,994,00017,088,512
3Apr 28, 2026 02:093,831591,191,195563,662,00010,993,00017,092,608
4Apr 28, 2026 02:093,831590,553,604563,729,00010,994,00017,092,608
5Apr 28, 2026 02:093,832591,503,208564,811,0009,996,00017,088,512
6Apr 28, 2026 02:093,832591,800,776565,874,0008,998,00017,154,048
7Apr 28, 2026 02:093,833595,107,188566,018,0009,000,00017,096,704
8Apr 28, 2026 02:093,834592,811,924565,227,00010,004,00017,088,512
9Apr 28, 2026 02:093,837593,437,565566,601,0008,993,00017,096,704