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 7, 2026 04:52Elijah KinElijah KinScore: 2,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 04:532,23614,667,9744,477,0001,114,0002,117,632
2Jun 7, 2026 04:532,23814,704,7724,478,0001,117,0002,117,632
3Jun 7, 2026 04:532,24914,690,3314,509,0001,114,0002,117,632
4Jun 7, 2026 04:532,32514,927,1714,698,0001,115,0002,117,632
5Jun 7, 2026 04:532,36115,011,4654,791,0001,112,0002,117,632
6Jun 7, 2026 04:532,46215,225,8335,052,0001,105,0002,117,632
7Jun 7, 2026 04:532,47715,336,3805,088,0001,106,0002,117,632
8Jun 7, 2026 04:532,52315,281,9605,203,0001,106,0002,117,632
9Jun 7, 2026 04:532,56215,416,0925,287,0001,120,0002,117,632