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 03:45limanjun99limanjun99Score: 4,512Success
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 03:454,509709,174,660648,421,00027,975,00017,068,032
2Apr 18, 2026 03:454,509701,318,161654,426,00021,980,00017,174,528
3Apr 18, 2026 03:454,509704,506,751652,435,00023,979,00017,059,840
4Apr 18, 2026 03:454,511701,708,389656,634,00019,988,00017,178,624
5Apr 18, 2026 03:454,512701,787,426656,752,00019,992,00016,957,440
6Apr 18, 2026 03:454,514699,728,665655,127,00022,004,00017,010,688
7Apr 18, 2026 03:454,517701,678,813658,630,00018,989,00017,047,552
8Apr 18, 2026 03:454,520699,911,573659,054,00019,001,00016,957,440
9Apr 18, 2026 03:454,530705,364,895655,471,00023,980,00017,063,936