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 29, 2026 01:02Victor MerckléVictor MerckléScore: 2,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 01:032,74016,831,1884,279,0002,573,0002,142,208
2Jun 29, 2026 01:032,74216,912,0534,275,0002,580,0002,142,208
3Jun 29, 2026 01:032,74416,997,6734,161,0002,701,0002,142,208
4Jun 29, 2026 01:032,75415,961,8954,314,0002,571,0002,138,112
5Jun 29, 2026 01:032,75917,098,3304,568,0002,330,0002,142,208
6Jun 29, 2026 01:032,76515,795,4334,288,0002,626,0002,138,112
7Jun 29, 2026 01:032,80516,800,0484,290,0002,724,0002,142,208
8Jun 29, 2026 01:032,92217,281,6324,951,0002,355,0002,142,208
9Jun 29, 2026 01:033,03217,688,4415,117,0002,465,0002,142,208