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:46Victor MerckléVictor MerckléScore: 6,270Success
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:475,99824,127,34711,785,0003,210,0002,117,632
2Jun 14, 2026 01:476,18924,578,42612,227,0003,247,0002,117,632
3Jun 14, 2026 01:476,20524,610,52512,298,0003,215,0002,117,632
4Jun 14, 2026 01:476,24624,785,25512,376,0003,240,0002,117,632
5Jun 14, 2026 01:476,27024,798,14412,476,0003,200,0002,117,632
6Jun 14, 2026 01:476,29024,810,27012,500,0003,226,0002,117,632
7Jun 14, 2026 01:476,29024,905,68212,480,0003,245,0002,117,632
8Jun 14, 2026 01:476,30624,960,45012,525,0003,242,0002,117,632
9Jun 14, 2026 01:476,35425,053,40512,553,0003,334,0002,117,632