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 15:10anboto1anboto1Score: 3,009Success
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 15:103,004459,888,523438,561,00012,097,00016,793,600
2Jun 24, 2026 15:103,004459,948,532438,829,00011,873,00016,793,600
3Jun 24, 2026 15:103,006460,263,930439,092,00011,951,00016,793,600
4Jun 24, 2026 15:103,007460,396,618439,221,00011,940,00016,793,600
5Jun 24, 2026 15:103,009460,712,807439,480,00011,927,00016,793,600
6Jun 24, 2026 15:103,013461,222,665440,497,00011,588,00016,793,600
7Jun 24, 2026 15:103,014461,411,358440,184,00012,059,00016,793,600
8Jun 24, 2026 15:103,018461,884,084440,637,00012,065,00016,793,600
9Jun 24, 2026 15:103,022462,553,617441,410,00011,944,00016,793,600