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 listOct 31, 2025 13:40Huy Duc LeHuy Duc LeScore: 2,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2025 13:402,973472,092,234414,894,00030,992,00016,986,112
2Oct 31, 2025 13:402,976476,226,523421,483,00024,969,00016,982,016
3Oct 31, 2025 13:402,980477,066,501415,934,00030,995,00017,006,592
4Oct 31, 2025 13:402,983477,665,289417,428,00029,958,00016,998,400
5Oct 31, 2025 13:402,983476,099,097414,538,00032,963,00017,006,592
6Oct 31, 2025 13:402,985468,730,818417,761,00029,982,00017,170,432
7Oct 31, 2025 13:402,991471,188,972420,737,00027,982,00016,986,112
8Oct 31, 2025 13:402,995478,265,072425,171,00024,009,00017,076,224
9Oct 31, 2025 13:403,003481,774,318415,456,00034,954,00016,982,016