Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listJun 3, 2026 09:04Victor MerckléVictor MerckléScore: 1,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 09:051,73411,947,2863,120,0001,216,0002,113,536
2Jun 3, 2026 09:051,73612,010,3543,114,0001,226,0002,113,536
3Jun 3, 2026 09:051,74412,020,5603,087,0001,275,0002,113,536
4Jun 3, 2026 09:051,83512,500,0003,367,0001,222,0002,113,536
5Jun 3, 2026 09:051,83612,168,3683,372,0001,218,0002,113,536
6Jun 3, 2026 09:051,86112,296,9163,441,0001,212,0002,113,536
7Jun 3, 2026 09:051,87212,703,2123,452,0001,229,0002,113,536
8Jun 3, 2026 09:051,88912,714,3693,486,0001,237,0002,113,536
9Jun 3, 2026 09:051,89812,742,8013,458,0001,287,0002,113,536