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 03:24Victor MerckléVictor MerckléScore: 5,488Success
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 03:255,46022,788,55310,514,0003,138,0002,117,632
2Jun 14, 2026 03:255,47822,797,21810,558,0003,137,0002,117,632
3Jun 14, 2026 03:255,47922,912,97010,563,0003,135,0002,117,632
4Jun 14, 2026 03:255,48222,829,38810,530,0003,176,0002,117,632
5Jun 14, 2026 03:255,48822,905,16010,550,0003,172,0002,117,632
6Jun 14, 2026 03:255,56323,031,84910,689,0003,219,0002,117,632
7Jun 14, 2026 03:255,86723,825,34411,550,0003,119,0002,117,632
8Jun 14, 2026 03:255,96024,038,32011,770,0003,131,0002,117,632
9Jun 14, 2026 03:255,98624,130,00411,836,0003,131,0002,117,632