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 5, 2026 17:23Elijah KinElijah KinScore: 2,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 17:252,57215,609,9145,290,0001,142,0002,117,632
2Jun 5, 2026 17:252,57515,625,7645,319,0001,120,0002,117,632
3Jun 5, 2026 17:252,58115,526,0575,324,0001,130,0002,117,632
4Jun 5, 2026 17:252,72815,890,3985,654,0001,168,0002,117,632
5Jun 5, 2026 17:252,74615,947,6015,705,0001,161,0002,117,632
6Jun 5, 2026 17:252,82816,472,7345,925,0001,146,0002,117,632
7Jun 5, 2026 17:252,86416,629,7375,981,0001,179,0002,117,632
8Jun 5, 2026 17:252,86616,753,6865,978,0001,189,0002,117,632
9Jun 5, 2026 17:252,87616,682,8316,048,0001,144,0002,117,632