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 listAug 29, 2026 11:03Victor MerckléVictor MerckléScore: 1,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 11:041,60712,353,4792,923,0001,096,0002,117,632stderr
2Aug 29, 2026 11:041,60912,407,2022,924,0001,100,0002,117,632stderr
3Aug 29, 2026 11:041,61213,734,0362,932,0001,100,0002,117,632stderr
4Aug 29, 2026 11:041,61312,508,9742,934,0001,099,0002,117,632stderr
5Aug 29, 2026 11:041,67512,486,0923,054,0001,134,0002,117,632stderr
6Aug 29, 2026 11:041,71213,208,2513,154,0001,127,0002,117,632stderr
7Aug 29, 2026 11:041,72812,680,8853,180,0001,142,0002,117,632stderr
8Aug 29, 2026 11:041,73113,139,8423,173,0001,156,0002,117,632stderr
9Aug 29, 2026 11:041,74112,758,6763,205,0001,148,0002,117,632stderr