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 24, 2026 10:53anboto1anboto1Score: 4,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:544,250646,796,547617,527,00020,086,00016,793,600
2Jun 24, 2026 10:544,258648,082,201618,640,00020,141,00016,793,600
3Jun 24, 2026 10:544,260648,418,973619,001,00020,082,00016,793,600
4Jun 24, 2026 10:544,260648,223,410618,860,00020,151,00016,793,600
5Jun 24, 2026 10:544,261648,824,519618,817,00020,431,00016,793,600
6Jun 24, 2026 10:544,262648,608,593618,943,00020,476,00016,793,600
7Jun 24, 2026 10:544,263648,810,518619,934,00019,565,00016,793,600
8Jun 24, 2026 10:544,271650,141,828620,875,00019,851,00016,793,600
9Jun 24, 2026 10:544,280651,234,434622,409,00019,622,00016,793,600