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 21, 2026 02:50olliecrowolliecrowScore: 3,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 02:503,422530,548,390511,341,0002,001,00017,055,744
2Apr 21, 2026 02:503,423540,335,176508,553,0004,995,00017,018,880
3Apr 21, 2026 02:503,423542,619,249506,533,0006,993,00017,035,264
4Apr 21, 2026 02:503,423544,558,607508,566,0004,995,00016,969,728
5Apr 21, 2026 02:503,425536,255,685508,819,0004,998,00017,145,856
6Apr 21, 2026 02:503,425540,632,816508,873,0004,998,00017,006,592
7Apr 21, 2026 02:503,425542,410,305511,877,0001,999,00017,108,992
8Apr 21, 2026 02:503,426533,865,284509,011,0005,000,00016,990,208
9Apr 21, 2026 02:503,428547,616,404511,275,0003,001,00016,977,920