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 listSep 19, 2026 20:03Elijah KinElijah KinScore: 2,266Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 20:042,01715,134,5603,784,0001,260,0002,121,728stderr
2Sep 19, 2026 20:042,01915,101,2863,792,0001,257,0002,121,728stderr
3Sep 19, 2026 20:042,22915,668,8284,294,0001,279,0002,121,728stderr
4Sep 19, 2026 20:042,25415,744,4984,358,0001,277,0002,121,728stderr
5Sep 19, 2026 20:042,26615,866,5244,387,0001,279,0002,121,728stderr
6Sep 19, 2026 20:042,28916,279,2684,429,0001,294,0002,121,728stderr
7Sep 19, 2026 20:042,29715,965,1214,459,0001,284,0002,121,728stderr
8Sep 19, 2026 20:042,30315,906,2404,463,0001,296,0002,121,728stderr
9Sep 19, 2026 20:042,31615,885,1124,496,0001,294,0002,121,728stderr