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 listJun 30, 2026 23:05Victor MerckléVictor MerckléScore: 1,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 23:071,65412,064,1412,993,0001,144,0002,121,728stderr
2Jun 30, 2026 23:071,69812,146,7513,122,0001,123,0002,121,728stderr
3Jun 30, 2026 23:071,70411,974,4613,133,0001,127,0002,121,728stderr
4Jun 30, 2026 23:071,71312,221,5903,147,0001,137,0002,121,728stderr
5Jun 30, 2026 23:071,76612,314,7013,340,0001,077,0002,121,728stderr
6Jun 30, 2026 23:071,76812,366,0983,357,0001,063,0002,121,728stderr
7Jun 30, 2026 23:071,78612,350,0353,393,0001,072,0002,121,728stderr
8Jun 30, 2026 23:071,82112,482,4553,427,0001,126,0002,121,728stderr
9Jun 30, 2026 23:071,84712,920,7463,458,0001,160,0002,121,728stderr