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 3, 2026 04:40Elijah KinElijah KinScore: 8,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 04:408,22029,773,70817,454,0003,098,0002,117,632
2Jun 3, 2026 04:408,25029,850,13317,520,0003,105,0002,117,632
3Jun 3, 2026 04:408,25229,837,45817,541,0003,091,0002,117,632
4Jun 3, 2026 04:408,27129,897,89817,587,0003,091,0002,117,632
5Jun 3, 2026 04:408,30730,053,37417,633,0003,135,0002,117,632
6Jun 3, 2026 04:408,31329,936,13517,655,0003,128,0002,117,632
7Jun 3, 2026 04:408,33630,068,49417,489,0003,351,0002,117,632
8Jun 3, 2026 04:408,36130,218,49117,666,0003,238,0002,117,632
9Jun 3, 2026 04:408,47630,788,50618,045,0003,145,0002,117,632