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 14, 2026 23:46Victor MerckléVictor MerckléScore: 1,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 23:461,43812,425,3972,031,0001,565,0002,117,632stderr
2Sep 14, 2026 23:461,44113,141,4752,098,0001,506,0002,117,632stderr
3Sep 14, 2026 23:461,44812,273,3052,447,0001,173,0002,117,632stderr
4Sep 14, 2026 23:461,45012,496,7892,094,0001,531,0002,117,632stderr
5Sep 14, 2026 23:461,45812,325,4242,093,0001,552,0002,117,632stderr
6Sep 14, 2026 23:461,47113,132,2192,132,0001,546,0002,117,632stderr
7Sep 14, 2026 23:461,48012,405,3552,145,0001,556,0002,117,632stderr
8Sep 14, 2026 23:461,49013,175,0252,141,0001,585,0002,117,632stderr
9Sep 14, 2026 23:461,49112,443,6462,145,0001,584,0002,117,632stderr