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 4, 2026 19:57Elijah KinElijah KinScore: 2,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 19:592,61415,530,5995,416,0001,119,0002,117,632
2Jun 4, 2026 19:592,61715,559,3755,431,0001,113,0002,117,632
3Jun 4, 2026 19:592,61715,572,7755,431,0001,113,0002,117,632
4Jun 4, 2026 19:592,62015,575,7115,417,0001,133,0002,117,632
5Jun 4, 2026 19:592,65515,683,3795,499,0001,140,0002,117,632
6Jun 4, 2026 19:592,77416,358,4395,768,0001,167,0002,117,632
7Jun 4, 2026 19:592,79416,772,2235,860,0001,127,0002,117,632
8Jun 4, 2026 19:592,83016,594,7505,895,0001,180,0002,117,632
9Jun 4, 2026 19:592,86616,686,4585,973,0001,192,0002,117,632