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 13, 2026 22:59Victor MerckléVictor MerckléScore: 6,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 23:005,77723,591,48511,224,0003,219,0002,117,632
2Jun 13, 2026 23:005,79223,643,28411,261,0003,219,0002,117,632
3Jun 13, 2026 23:005,80223,691,48411,264,0003,243,0002,117,632
4Jun 13, 2026 23:005,96024,115,55411,695,0003,206,0002,117,632
5Jun 13, 2026 23:006,25024,843,38212,433,0003,193,0002,117,632
6Jun 13, 2026 23:006,30624,857,65412,594,0003,172,0002,117,632
7Jun 13, 2026 23:006,31424,929,45812,571,0003,215,0002,117,632
8Jun 13, 2026 23:006,35725,060,99212,691,0003,202,0002,117,632
9Jun 13, 2026 23:006,38425,195,97112,760,0003,201,0002,117,632