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 18:24Elijah KinElijah KinScore: 2,596Success
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 18:272,56615,422,0385,325,0001,092,0002,117,632
2Jun 4, 2026 18:272,58815,502,7795,365,0001,106,0002,117,632
3Jun 4, 2026 18:272,59415,556,9855,383,0001,103,0002,117,632
4Jun 4, 2026 18:272,59415,452,6755,383,0001,104,0002,117,632
5Jun 4, 2026 18:272,59615,494,7235,391,0001,099,0002,117,632
6Jun 4, 2026 18:272,70815,949,7645,650,0001,120,0002,117,632
7Jun 4, 2026 18:272,72415,767,3715,693,0001,118,0002,117,632
8Jun 4, 2026 18:272,79016,390,3235,851,0001,124,0002,117,632
9Jun 4, 2026 18:272,89416,772,9206,042,0001,195,0002,117,632