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 listMay 21, 2026 22:06Jacob McDanielJacob McDanielScore: 2,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 22:072,50216,565,9125,062,0001,193,0002,117,632
2May 21, 2026 22:072,50216,584,5125,068,0001,189,0002,117,632
3May 21, 2026 22:072,50215,523,4195,065,0001,192,0002,117,632
4May 21, 2026 22:072,50815,517,3065,073,0001,197,0002,117,632
5May 21, 2026 22:072,50915,552,5045,075,0001,198,0002,117,632
6May 21, 2026 22:072,52115,608,6885,097,0001,206,0002,117,632
7May 21, 2026 22:072,52215,933,4685,102,0001,204,0002,117,632
8May 21, 2026 22:072,52916,088,3675,107,0001,217,0002,117,632
9May 21, 2026 22:072,65929,192,3145,440,0001,208,0002,117,632