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 10, 2026 04:50Victor MerckléVictor MerckléScore: 3,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 04:563,89817,295,0677,485,0002,262,0002,113,536
2Jun 10, 2026 04:563,90517,235,3427,503,0002,261,0002,113,536
3Jun 10, 2026 04:563,90517,232,0587,494,0002,269,0002,113,536
4Jun 10, 2026 04:563,91217,274,9407,514,0002,266,0002,113,536
5Jun 10, 2026 04:563,92317,296,3767,502,0002,306,0002,113,536
6Jun 10, 2026 04:564,07817,682,0007,726,0002,469,0002,113,536
7Jun 10, 2026 04:564,12617,790,7917,812,0002,505,0002,113,536
8Jun 10, 2026 04:564,13217,817,0167,774,0002,557,0002,113,536
9Jun 10, 2026 04:564,19517,985,3567,990,0002,499,0002,113,536