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 20:36anboto1anboto1Score: 3,531Success
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 20:363,531539,592,447516,658,00012,994,00016,793,600
2Jul 29, 2026 20:363,531539,709,929516,743,00013,020,00016,793,600
3Jul 29, 2026 20:363,531539,666,518516,637,00013,052,00016,793,600
4Jul 29, 2026 20:363,531539,741,109516,822,00012,923,00016,793,600
5Jul 29, 2026 20:363,531539,792,000516,725,00013,025,00016,793,600
6Jul 29, 2026 20:363,532539,806,418516,952,00012,923,00016,793,600
7Jul 29, 2026 20:363,532539,797,170516,893,00012,928,00016,793,600
8Jul 29, 2026 20:363,532539,733,573516,823,00012,980,00016,793,600
9Jul 29, 2026 20:363,533540,083,697516,959,00013,114,00016,793,600