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 9, 2026 03:13Elijah KinElijah KinScore: 2,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 03:142,28814,811,9594,474,0001,246,0002,117,632
2Jun 9, 2026 03:142,28914,745,7274,499,0001,224,0002,117,632
3Jun 9, 2026 03:142,29314,778,9164,498,0001,236,0002,117,632
4Jun 9, 2026 03:142,30614,803,2964,515,0001,251,0002,117,632
5Jun 9, 2026 03:142,40615,008,7584,762,0001,253,0002,117,632
6Jun 9, 2026 03:142,42815,236,4934,812,0001,258,0002,117,632
7Jun 9, 2026 03:142,52815,424,4745,070,0001,250,0002,117,632
8Jun 9, 2026 03:142,52915,682,3275,091,0001,233,0002,117,632
9Jun 9, 2026 03:142,53615,344,3885,086,0001,256,0002,117,632