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 listMay 25, 2026 22:14Elijah KinElijah KinScore: 13,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 22:1613,82046,101,00031,480,0003,072,0002,113,536
2May 25, 2026 22:1613,82945,276,64031,492,0003,082,0002,113,536
3May 25, 2026 22:1613,85544,886,83531,516,0003,122,0002,113,536
4May 25, 2026 22:1613,85643,939,36731,400,0003,242,0002,113,536
5May 25, 2026 22:1613,92545,601,77331,532,0003,281,0002,113,536
6May 25, 2026 22:1613,96945,626,16931,636,0003,287,0002,113,536
7May 25, 2026 22:1613,97944,998,37031,846,0003,102,0002,113,536
8May 25, 2026 22:1613,98146,532,24131,649,0003,304,0002,113,536
9May 25, 2026 22:1613,98946,195,74531,874,0003,099,0002,113,536