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 listSep 15, 2026 05:42Victor MerckléVictor MerckléScore: 1,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 05:431,35012,246,8441,838,0001,537,0002,117,632stderr
2Sep 15, 2026 05:431,37812,190,5051,890,0001,557,0002,117,632stderr
3Sep 15, 2026 05:431,37912,198,5421,892,0001,556,0002,117,632stderr
4Sep 15, 2026 05:431,38212,169,8351,900,0001,557,0002,117,632stderr
5Sep 15, 2026 05:431,39712,048,5001,930,0001,563,0002,117,632stderr
6Sep 15, 2026 05:431,41012,427,0861,969,0001,558,0002,117,632stderr
7Sep 15, 2026 05:431,49012,411,0472,576,0001,149,0002,117,632stderr
8Sep 15, 2026 05:431,49412,398,2772,143,0001,592,0002,117,632stderr
9Sep 15, 2026 05:431,49813,107,4092,580,0001,167,0002,117,632stderr