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 listJun 24, 2026 11:52anboto1anboto1Score: 3,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:523,740570,299,350532,657,00028,433,00016,793,600
2Jun 24, 2026 11:523,743571,072,392533,105,00028,439,00016,793,600
3Jun 24, 2026 11:523,744570,939,452532,554,00029,174,00016,793,600
4Jun 24, 2026 11:523,744570,781,906533,359,00028,346,00016,793,600
5Jun 24, 2026 11:523,745571,031,143532,887,00028,938,00016,793,600
6Jun 24, 2026 11:523,746571,337,823533,161,00028,885,00016,793,600
7Jun 24, 2026 11:523,751571,916,372533,241,00029,477,00016,793,600
8Jun 24, 2026 11:523,755572,535,872534,236,00029,139,00016,793,600
9Jun 24, 2026 11:523,763573,525,802536,638,00027,842,00016,793,600