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 9, 2026 23:58Victor MerckléVictor MerckléScore: 3,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 00:013,56217,727,0246,086,0002,819,0002,138,112
2Jun 10, 2026 00:013,59017,876,9655,336,0003,639,0002,187,264
3Jun 10, 2026 00:013,61017,997,9516,489,0002,538,0002,138,112
4Jun 10, 2026 00:013,61317,935,0116,539,0002,494,0002,138,112
5Jun 10, 2026 00:013,61417,938,2586,176,0002,861,0002,138,112
6Jun 10, 2026 00:013,61717,800,8426,190,0002,853,0002,129,920
7Jun 10, 2026 00:013,62018,047,5386,533,0002,518,0002,138,112
8Jun 10, 2026 00:013,62618,033,9226,185,0002,880,0002,134,016
9Jun 10, 2026 00:013,71117,990,3885,829,0003,449,0002,138,112