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 2, 2026 00:02Victor MerckléVictor MerckléScore: 2,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 00:042,25313,284,5274,397,0001,237,0002,113,536
2Jun 2, 2026 00:042,26013,310,3354,413,0001,238,0002,113,536
3Jun 2, 2026 00:042,26613,337,1694,368,0001,298,0002,113,536
4Jun 2, 2026 00:042,26613,346,8434,426,0001,239,0002,113,536
5Jun 2, 2026 00:042,35013,581,1044,643,0001,232,0002,113,536
6Jun 2, 2026 00:042,35514,916,1194,653,0001,235,0002,113,536
7Jun 2, 2026 00:042,36013,654,1204,668,0001,233,0002,113,536
8Jun 2, 2026 00:042,36413,478,5694,673,0001,239,0002,113,536
9Jun 2, 2026 00:042,36813,593,6914,684,0001,237,0002,113,536