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 20, 2026 16:50BenBenScore: 4,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:524,107643,536,811592,140,00024,005,00017,158,144
2Apr 20, 2026 16:524,107634,607,232593,087,00023,003,00017,141,760
3Apr 20, 2026 16:524,109643,591,313591,451,00024,976,00017,154,048
4Apr 20, 2026 16:524,111630,627,405592,664,00023,986,00017,076,224
5Apr 20, 2026 16:524,112635,246,734591,933,00024,997,00017,145,856
6Apr 20, 2026 16:524,115645,398,265593,417,00023,976,00017,154,048
7Apr 20, 2026 16:524,116641,254,778592,434,00024,976,00017,141,760
8Apr 20, 2026 16:524,172650,623,269604,917,00020,997,00017,158,144
9Apr 20, 2026 16:524,219655,226,365609,937,00022,997,00016,936,960