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 14, 2026 00:40Victor MerckléVictor MerckléScore: 6,172Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 00:416,13924,489,11112,132,0003,217,0002,117,632
2Jun 14, 2026 00:416,14424,553,91512,162,0003,198,0002,117,632
3Jun 14, 2026 00:416,14524,543,08712,165,0003,198,0002,117,632
4Jun 14, 2026 00:416,16324,607,49012,194,0003,215,0002,117,632
5Jun 14, 2026 00:416,17224,484,71712,223,0003,207,0002,117,632
6Jun 14, 2026 00:416,21724,750,89912,338,0003,206,0002,117,632
7Jun 14, 2026 00:416,25824,840,68512,461,0003,184,0002,117,632
8Jun 14, 2026 00:416,27525,121,68312,468,0003,220,0002,117,632
9Jun 14, 2026 00:416,29724,889,85712,540,0003,203,0002,117,632