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:07Jacob McDanielJacob McDanielScore: 2,726Success
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,69516,194,3725,545,0001,193,0002,121,728
2May 21, 2026 22:072,70116,103,3715,565,0001,189,0002,121,728
3May 21, 2026 22:072,70216,154,8685,553,0001,203,0002,121,728
4May 21, 2026 22:072,72116,229,6785,595,0001,208,0002,121,728
5May 21, 2026 22:072,72616,405,0705,626,0001,189,0002,121,728
6May 21, 2026 22:072,73316,723,9215,611,0001,223,0002,121,728
7May 21, 2026 22:072,82217,320,3775,857,0001,200,0002,121,728
8May 21, 2026 22:072,84019,178,8765,839,0001,263,0002,121,728
9May 21, 2026 22:072,85516,789,8205,860,0001,279,0002,121,728