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 13, 2026 12:56Victor MerckléVictor MerckléScore: 25,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 12:5724,54970,693,82357,352,0004,022,0002,117,632
2Jun 13, 2026 12:5724,75871,147,00557,865,0004,030,0002,117,632
3Jun 13, 2026 12:5724,90871,456,53859,219,0003,053,0002,117,632
4Jun 13, 2026 12:5725,10971,986,41859,725,0003,048,0002,117,632
5Jun 13, 2026 12:5725,20772,191,05658,998,0004,021,0002,117,632
6Jun 13, 2026 12:5725,21872,219,86359,022,0004,025,0002,117,632
7Jun 13, 2026 12:5725,36872,585,97659,390,0004,031,0002,117,632
8Jun 13, 2026 12:5725,56973,032,46760,865,0003,058,0002,117,632
9Jun 13, 2026 12:5725,79373,669,64960,324,0004,159,0002,117,632