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 10, 2026 01:06Elijah KinElijah KinScore: 2,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 01:072,44715,242,9574,997,0001,121,0002,121,728
2Jun 10, 2026 01:072,45815,285,9115,019,0001,128,0002,121,728
3Jun 10, 2026 01:072,45915,328,1065,025,0001,124,0002,121,728
4Jun 10, 2026 01:072,72416,287,4865,659,0001,151,0002,121,728
5Jun 10, 2026 01:072,72616,301,4765,695,0001,121,0002,121,728
6Jun 10, 2026 01:072,74916,418,4125,759,0001,114,0002,117,632
7Jun 10, 2026 01:072,75316,080,1815,763,0001,121,0002,121,728
8Jun 10, 2026 01:072,76016,388,8415,787,0001,114,0002,121,728
9Jun 10, 2026 01:072,77116,480,4895,788,0001,141,0002,121,728