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 listJun 24, 2026 11:59anboto1anboto1Score: 3,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:593,192487,965,852453,994,00024,851,00016,793,600
2Jun 24, 2026 11:593,194488,355,575454,283,00024,893,00016,793,600
3Jun 24, 2026 11:593,200489,236,975455,132,00024,941,00016,793,600
4Jun 24, 2026 11:593,203489,742,873455,334,00025,165,00016,793,600
5Jun 24, 2026 11:593,204489,822,387455,078,00025,574,00016,793,600
6Jun 24, 2026 11:593,204489,839,552455,854,00024,830,00016,793,600
7Jun 24, 2026 11:593,207490,350,178456,447,00024,640,00016,793,600
8Jun 24, 2026 11:593,208490,682,597456,033,00025,310,00016,793,600
9Jun 24, 2026 11:593,211490,927,411455,803,00025,937,00016,793,600