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 22:05anboto1anboto1Score: 3,115Success
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 22:063,086473,016,379437,462,00025,469,00016,793,600
2Jul 29, 2026 22:063,093473,995,293438,772,00025,272,00016,793,600
3Jul 29, 2026 22:063,100475,220,533439,608,00025,539,00016,793,600
4Jul 29, 2026 22:063,114477,259,204440,824,00026,307,00016,793,600
5Jul 29, 2026 22:063,115477,250,249440,998,00026,255,00016,793,600
6Jul 29, 2026 22:063,116484,872,176441,299,00026,187,00016,793,600
7Jul 29, 2026 22:063,122478,279,086442,470,00025,870,00016,793,600
8Jul 29, 2026 22:063,124478,750,499442,908,00025,793,00016,793,600
9Jul 29, 2026 22:063,131479,625,817443,923,00025,731,00016,793,600