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 listMar 15, 2026 02:53Elijah KinElijah KinScore: 23,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 02:5322,37282,797,05352,935,0002,996,0002,265,088
2Mar 15, 2026 02:5323,05188,183,56255,606,0002,022,0002,314,240
3Mar 15, 2026 02:5323,09489,308,72755,710,0002,025,0002,265,088