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 listOct 7, 2026 21:22Karthik ReddyKarthik ReddyScore: 1,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 21:231,44612,481,7092,367,0001,249,000520,192
2Oct 7, 2026 21:231,45112,498,5492,370,0001,258,000520,192
3Oct 7, 2026 21:231,45112,513,6082,370,0001,258,000520,192
4Oct 7, 2026 21:231,45212,443,9602,366,0001,264,000520,192
5Oct 7, 2026 21:231,45212,366,2312,374,0001,256,000520,192
6Oct 7, 2026 21:231,45412,410,0042,522,0001,113,000520,192
7Oct 7, 2026 21:231,46012,508,4582,393,0001,257,000520,192
8Oct 7, 2026 21:231,67113,090,5502,911,0001,267,000520,192
9Oct 7, 2026 21:231,68513,162,0842,935,0001,278,000520,192