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 1, 2026 10:31Victor MerckléVictor MerckléScore: 2,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 10:322,50713,808,5184,947,0001,322,0002,113,536
2Jun 1, 2026 10:322,50915,248,7454,953,0001,321,0002,113,536
3Jun 1, 2026 10:322,51413,853,8704,959,0001,328,0002,113,536
4Jun 1, 2026 10:322,51913,867,3894,947,0001,351,0002,113,536
5Jun 1, 2026 10:322,60214,049,6345,185,0001,321,0002,113,536
6Jun 1, 2026 10:322,61013,987,6885,204,0001,322,0002,113,536
7Jun 1, 2026 10:322,61413,918,9115,211,0001,326,0002,113,536
8Jun 1, 2026 10:322,61514,078,0735,215,0001,323,0002,113,536
9Jun 1, 2026 10:322,62514,095,9975,228,0001,335,0002,113,536