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 1, 2026 15:13Victor MerckléVictor MerckléScore: 2,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 15:152,51713,834,6084,966,0001,328,0002,113,536
2Jun 1, 2026 15:152,51913,842,0824,976,0001,322,0002,113,536
3Jun 1, 2026 15:152,52013,909,6124,977,0001,325,0002,113,536
4Jun 1, 2026 15:152,52113,935,7774,976,0001,327,0002,113,536
5Jun 1, 2026 15:152,52913,904,9574,996,0001,327,0002,113,536
6Jun 1, 2026 15:152,53013,874,6504,997,0001,330,0002,113,536
7Jun 1, 2026 15:152,53513,808,7155,012,0001,327,0002,113,536
8Jun 1, 2026 15:152,55213,933,9265,042,0001,339,0002,113,536
9Jun 1, 2026 15:152,60314,119,4005,140,0001,369,0002,113,536