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 17:14Victor MerckléVictor MerckléScore: 2,220Success
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 17:162,14813,047,6184,139,0001,233,0002,113,536
2Jun 2, 2026 17:162,15012,945,2154,142,0001,235,0002,113,536
3Jun 2, 2026 17:162,15613,035,7604,155,0001,235,0002,113,536
4Jun 2, 2026 17:162,21614,855,9184,310,0001,231,0002,113,536
5Jun 2, 2026 17:162,22013,089,4364,317,0001,235,0002,113,536
6Jun 2, 2026 17:162,22613,201,8424,326,0001,239,0002,113,536
7Jun 2, 2026 17:162,23413,546,5654,344,0001,242,0002,113,536
8Jun 2, 2026 17:162,23613,282,5564,344,0001,248,0002,113,536
9Jun 2, 2026 17:162,24213,221,7004,365,0001,240,0002,113,536