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 01:28Victor MerckléVictor MerckléScore: 5,976Success
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 01:295,91323,978,45711,574,0003,209,0002,117,632
2Jun 14, 2026 01:295,96424,139,90411,706,0003,206,0002,117,632
3Jun 14, 2026 01:295,96924,080,93711,703,0003,220,0002,117,632
4Jun 14, 2026 01:295,97224,071,36611,732,0003,198,0002,117,632
5Jun 14, 2026 01:295,97624,164,05211,708,0003,232,0002,117,632
6Jun 14, 2026 01:296,04224,345,53011,876,0003,231,0002,117,632
7Jun 14, 2026 01:296,05724,248,60911,973,0003,171,0002,117,632
8Jun 14, 2026 01:296,09024,623,78112,032,0003,194,0002,117,632
9Jun 14, 2026 01:296,11824,668,75712,069,0003,228,0002,117,632