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 23:06anboto1anboto1Score: 2,866Success
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 23:062,864439,608,293416,524,00013,097,00016,793,600
2Jul 29, 2026 23:062,865439,809,405416,618,00013,149,00016,793,600
3Jul 29, 2026 23:062,865439,698,483416,605,00013,158,00016,793,600
4Jul 29, 2026 23:062,865439,612,231416,573,00013,220,00016,793,600
5Jul 29, 2026 23:062,866439,985,320416,890,00013,124,00016,793,600
6Jul 29, 2026 23:062,868440,237,634416,994,00013,247,00016,793,600
7Jul 29, 2026 23:062,869440,419,455417,224,00013,270,00016,793,600
8Jul 29, 2026 23:062,870440,562,995417,372,00013,266,00016,793,600
9Jul 29, 2026 23:062,871440,544,671417,380,00013,284,00016,793,600