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 00:55Elijah 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 7, 2026 00:562,50116,089,9105,005,0001,249,0002,121,728
2Jun 7, 2026 00:562,51715,512,4135,051,0001,242,0002,121,728
3Jun 7, 2026 00:562,52115,632,7085,054,0001,250,0002,121,728
4Jun 7, 2026 00:562,72116,474,3785,534,0001,270,0002,121,728
5Jun 7, 2026 00:562,74616,471,4505,584,0001,282,0002,121,728
6Jun 7, 2026 00:562,75016,558,9435,623,0001,253,0002,121,728
7Jun 7, 2026 00:562,75316,639,7575,648,0001,236,0002,121,728
8Jun 7, 2026 00:562,77416,577,2575,683,0001,254,0002,121,728
9Jun 7, 2026 00:562,78816,609,2145,698,0001,273,0002,121,728