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:26limanjun99limanjun99Score: 3,121Success
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:263,113494,124,914437,931,00028,995,00017,145,856
2Apr 18, 2026 05:263,116497,234,505425,401,00041,940,00016,994,304
3Apr 18, 2026 05:263,116494,982,508432,465,00034,956,00016,986,112
4Apr 18, 2026 05:263,117495,884,890430,599,00036,965,00017,014,784
5Apr 18, 2026 05:263,121493,565,264435,180,00033,013,00016,986,112
6Apr 18, 2026 05:263,124493,456,275433,676,00034,973,00017,125,376
7Apr 18, 2026 05:263,130498,757,821432,478,00036,955,00017,133,568
8Apr 18, 2026 05:263,137492,675,796438,604,00031,971,00017,022,976
9Apr 18, 2026 05:263,141498,360,819434,070,00037,006,00017,076,224