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 15:55anboto1anboto1Score: 4,008Success
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 15:564,004610,637,154593,758,0006,876,00016,793,600
2Jul 29, 2026 15:564,004611,390,791593,855,0006,892,00016,793,600
3Jul 29, 2026 15:564,007612,373,145594,133,0006,920,00016,793,600
4Jul 29, 2026 15:564,008611,306,392594,473,0006,832,00016,793,600
5Jul 29, 2026 15:564,008611,281,307594,377,0006,842,00016,793,600
6Jul 29, 2026 15:564,012611,962,665594,998,0006,931,00016,793,600
7Jul 29, 2026 15:564,013611,938,059595,040,0006,923,00016,793,600
8Jul 29, 2026 15:564,013612,048,101594,906,0007,156,00016,793,600
9Jul 29, 2026 15:564,013612,109,471595,163,0006,928,00016,793,600