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:14Victor MerckléVictor MerckléScore: 6,729Success
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:156,28924,894,98312,628,0003,096,0002,117,632
2Jun 14, 2026 03:156,36524,998,10912,749,0003,164,0002,117,632
3Jun 14, 2026 03:156,37025,013,76312,775,0003,151,0002,117,632
4Jun 14, 2026 03:156,38225,203,88912,839,0003,118,0002,117,632
5Jun 14, 2026 03:156,72925,994,27813,701,0003,122,0002,117,632
6Jun 14, 2026 03:156,82626,219,20013,941,0003,126,0002,117,632
7Jun 14, 2026 03:156,82626,224,86613,936,0003,129,0002,117,632
8Jun 14, 2026 03:156,93826,574,46414,173,0003,172,0002,117,632
9Jun 14, 2026 03:156,96926,588,99614,250,0003,174,0002,117,632