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 26, 2026 02:19Charles CabergsCharles CabergsScore: 3,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 02:203,858596,586,771569,766,0008,996,00017,145,856
2Apr 26, 2026 02:203,860599,128,601569,129,00010,002,00017,068,032
3Apr 26, 2026 02:203,860597,882,860570,013,0009,000,00017,158,144
4Apr 26, 2026 02:203,861594,122,251570,150,0009,002,00017,149,952
5Apr 26, 2026 02:203,862596,345,026569,355,00010,006,00016,986,112
6Apr 26, 2026 02:203,864596,260,827569,719,0009,995,00017,141,760
7Apr 26, 2026 02:203,865595,423,934570,803,0008,996,00017,141,760
8Apr 26, 2026 02:203,867604,437,273569,193,00011,003,00017,145,856
9Apr 26, 2026 02:203,898607,046,934576,842,0007,997,00016,990,208