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 26, 2026 13:10Kevin HeaveyKevin HeaveyScore: 1,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 13:111,16211,277,0282,905,0000524,288
2Sep 26, 2026 13:111,22412,202,4093,060,0000524,288
3Sep 26, 2026 13:111,25511,654,2673,139,0000524,288
4Sep 26, 2026 13:111,25612,359,5053,142,0000524,288
5Sep 26, 2026 13:111,25811,709,9953,145,0000524,288
6Sep 26, 2026 13:111,26112,135,0153,154,0000524,288
7Sep 26, 2026 13:111,26512,272,4823,163,0000524,288
8Sep 26, 2026 13:111,26911,883,8423,173,0000524,288
9Sep 26, 2026 13:111,27111,889,5713,179,0000524,288