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 14:46anboto1anboto1Score: 3,107Success
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 14:473,102474,815,374439,591,00025,799,00016,793,600
2Jun 24, 2026 14:473,103474,684,216440,440,00025,074,00016,793,600
3Jun 24, 2026 14:473,104474,882,111439,759,00025,860,00016,793,600
4Jun 24, 2026 14:473,105475,056,521439,661,00026,124,00016,793,600
5Jun 24, 2026 14:473,107475,321,154440,955,00025,237,00016,793,600
6Jun 24, 2026 14:473,109475,685,329440,448,00025,986,00016,793,600
7Jun 24, 2026 14:473,115476,452,510442,558,00024,726,00016,793,600
8Jun 24, 2026 14:473,117476,762,020442,326,00025,346,00016,793,600
9Jun 24, 2026 14:473,119477,198,704442,414,00025,521,00016,793,600