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:39anboto1anboto1Score: 5,523Success
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:405,325808,843,476778,892,00019,985,00016,793,600
2Jul 29, 2026 20:405,370815,480,361785,264,00020,264,00016,793,600
3Jul 29, 2026 20:405,470830,525,534799,640,00020,941,00016,793,600
4Jul 29, 2026 20:405,517837,608,617807,422,00020,231,00016,793,600
5Jul 29, 2026 20:405,523838,509,813807,750,00020,787,00016,793,600
6Jul 29, 2026 20:405,595849,325,511818,076,00021,218,00016,793,600
7Jul 29, 2026 20:405,626854,052,007822,772,00021,274,00016,793,600
8Jul 29, 2026 20:405,644856,533,509825,655,00020,992,00016,793,600
9Jul 29, 2026 20:405,680862,062,933831,228,00020,830,00016,793,600