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 30, 2026 00:11anboto1anboto1Score: 3,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:163,044466,729,534441,442,00015,179,00016,793,600
2Jul 30, 2026 00:163,044467,293,287441,473,00015,149,00016,793,600
3Jul 30, 2026 00:163,047467,083,383441,469,00015,696,00016,793,600
4Jul 30, 2026 00:163,052467,948,645442,694,00015,125,00016,793,600
5Jul 30, 2026 00:163,053468,201,574442,951,00015,145,00016,793,600
6Jul 30, 2026 00:163,061470,872,130444,336,00014,903,00016,793,600
7Jul 30, 2026 00:163,062469,372,655443,968,00015,367,00016,793,600
8Jul 30, 2026 00:163,064469,614,475444,279,00015,327,00016,793,600
9Jul 30, 2026 00:163,065469,747,124444,549,00015,253,00016,793,600