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 2, 2026 13:51Victor MerckléVictor MerckléScore: 2,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 13:532,14713,048,0854,129,0001,239,0002,113,536
2Jun 2, 2026 13:532,20913,198,8404,247,0001,277,0002,113,536
3Jun 2, 2026 13:532,22413,127,9434,315,0001,245,0002,113,536
4Jun 2, 2026 13:532,23013,194,8874,327,0001,248,0002,113,536
5Jun 2, 2026 13:532,23113,218,7114,336,0001,243,0002,113,536
6Jun 2, 2026 13:532,24213,212,0364,360,0001,247,0002,113,536
7Jun 2, 2026 13:532,24413,251,9894,359,0001,252,0002,113,536
8Jun 2, 2026 13:532,25413,272,5044,374,0001,263,0002,113,536
9Jun 2, 2026 13:532,28613,355,3664,435,0001,282,0002,113,536