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 19, 2026 00:48Charles CabergsCharles CabergsScore: 4,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 00:484,338678,946,953640,747,0009,996,00016,977,920
2Apr 19, 2026 00:484,344677,581,257641,550,0009,992,00016,977,920
3Apr 19, 2026 00:484,344674,375,646641,557,0009,993,00017,158,144
4Apr 19, 2026 00:484,345677,979,091643,823,0007,997,00016,977,920
5Apr 19, 2026 00:484,350677,586,641641,489,00010,991,00017,166,336
6Apr 19, 2026 00:484,353682,419,013642,997,0009,999,00017,072,128
7Apr 19, 2026 00:484,468696,399,660661,135,0009,001,00016,977,920
8Apr 19, 2026 00:484,472695,786,288658,805,00011,996,00016,986,112
9Apr 19, 2026 00:484,484694,519,136661,592,00010,993,00016,969,728