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 21:10anboto1anboto1Score: 3,044Success
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 21:103,038465,910,438442,629,00013,219,00016,793,600
2Jul 29, 2026 21:103,039466,034,388442,680,00013,281,00016,793,600
3Jul 29, 2026 21:103,041466,319,878442,904,00013,272,00016,793,600
4Jul 29, 2026 21:103,042466,288,969442,918,00013,407,00016,793,600
5Jul 29, 2026 21:103,044466,800,798443,444,00013,298,00016,793,600
6Jul 29, 2026 21:103,045466,688,403443,396,00013,380,00016,793,600
7Jul 29, 2026 21:103,054468,128,896444,923,00013,231,00016,793,600
8Jul 29, 2026 21:103,055468,112,165445,050,00013,252,00016,793,600
9Jul 29, 2026 21:103,058468,636,524445,497,00013,220,00016,793,600