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 27, 2026 00:20Charles CabergsCharles CabergsScore: 3,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 00:213,834598,780,762565,217,00010,003,00017,072,128
2Apr 27, 2026 00:213,837592,763,237566,581,0008,993,00017,076,224
3Apr 27, 2026 00:213,838590,877,432563,729,00011,994,00017,072,128
4Apr 27, 2026 00:213,838595,271,799566,838,0008,997,00017,076,224
5Apr 27, 2026 00:213,839594,546,882565,918,0009,998,00017,231,872
6Apr 27, 2026 00:213,840593,497,125565,021,00011,000,00017,068,032
7Apr 27, 2026 00:213,840596,956,882565,040,00011,000,00017,068,032
8Apr 27, 2026 00:213,841594,466,884566,205,00010,003,00017,063,936
9Apr 27, 2026 00:213,842595,115,985567,326,0009,005,00017,068,032