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 listApr 18, 2026 05:09limanjun99limanjun99Score: 3,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 05:093,699576,730,153518,818,00035,987,00017,117,184
2Apr 18, 2026 05:093,706580,489,674517,843,00037,988,00017,178,624
3Apr 18, 2026 05:093,715587,738,801515,249,00041,938,00017,154,048
4Apr 18, 2026 05:093,724581,709,128524,572,00033,972,00017,002,496
5Apr 18, 2026 05:093,725579,975,718528,744,00029,985,00017,154,048
6Apr 18, 2026 05:093,726584,576,338518,946,00039,995,00017,063,936
7Apr 18, 2026 05:093,735590,128,083521,349,00038,951,00017,113,088
8Apr 18, 2026 05:093,736584,721,374519,449,00040,956,00017,076,224
9Apr 18, 2026 05:093,737583,994,238520,541,00039,964,00016,961,536