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 11:11anboto1anboto1Score: 4,197Success
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 11:124,189637,557,328608,330,00020,109,00016,793,600
2Jun 24, 2026 11:124,193638,881,264608,837,00020,246,00016,793,600
3Jun 24, 2026 11:124,194638,363,128608,775,00020,349,00016,793,600
4Jun 24, 2026 11:124,196638,589,242609,234,00020,220,00016,793,600
5Jun 24, 2026 11:124,197638,858,660609,640,00020,035,00016,793,600
6Jun 24, 2026 11:124,201639,454,506609,885,00020,275,00016,793,600
7Jun 24, 2026 11:124,215641,513,516612,186,00020,100,00016,793,600
8Jun 24, 2026 11:124,227643,400,835614,328,00019,832,00016,793,600
9Jun 24, 2026 11:124,247646,418,984617,130,00020,057,00016,793,600