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 9, 2026 08:13Karthik ReddyKarthik ReddyScore: 1,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 08:221,23911,924,9071,846,0001,253,000524,288
2Oct 9, 2026 08:221,42312,368,3252,406,0001,152,000524,288
3Oct 9, 2026 08:221,46212,411,4242,504,0001,151,000524,288
4Oct 9, 2026 08:221,46212,414,7812,498,0001,157,000524,288
5Oct 9, 2026 08:221,46512,370,8492,513,0001,150,000524,288
6Oct 9, 2026 08:221,46713,035,2042,552,0001,116,000524,288
7Oct 9, 2026 08:221,46812,465,4902,557,0001,114,000524,288
8Oct 9, 2026 08:221,47612,458,5362,567,0001,124,000524,288
9Oct 9, 2026 08:221,47612,502,4182,576,0001,115,000524,288