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 23:38anboto1anboto1Score: 3,066Success
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 23:393,054468,449,492443,228,00014,984,00016,793,600
2Jul 29, 2026 23:393,055468,253,965442,942,00015,351,00016,793,600
3Jul 29, 2026 23:393,057470,005,620443,179,00015,473,00016,793,600
4Jul 29, 2026 23:393,062469,858,931443,883,00015,466,00016,793,600
5Jul 29, 2026 23:393,066469,870,099444,760,00015,217,00016,793,600
6Jul 29, 2026 23:393,068470,266,200445,003,00015,203,00016,793,600
7Jul 29, 2026 23:393,069470,467,297445,156,00015,250,00016,793,600
8Jul 29, 2026 23:393,070470,509,143445,542,00015,037,00016,793,600
9Jul 29, 2026 23:393,073471,065,172445,668,00015,310,00016,793,600