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 listJul 29, 2026 23:05anboto1anboto1Score: 3,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 23:053,216492,390,195468,599,00013,838,00016,797,696
2Jul 29, 2026 23:053,216492,313,560468,674,00013,753,00016,797,696
3Jul 29, 2026 23:053,218492,654,756468,942,00013,763,00016,797,696
4Jul 29, 2026 23:053,219492,897,005469,038,00013,814,00016,797,696
5Jul 29, 2026 23:053,221493,260,909469,336,00013,866,00016,797,696
6Jul 29, 2026 23:053,221493,229,525469,555,00013,654,00016,797,696
7Jul 29, 2026 23:053,222494,565,467469,704,00013,643,00016,797,696
8Jul 29, 2026 23:053,225493,867,147470,128,00013,766,00016,797,696
9Jul 29, 2026 23:053,228494,262,210470,311,00013,907,00016,797,696