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 07:52Victor MerckléVictor MerckléScore: 2,164Success
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 07:542,15513,050,4924,145,0001,244,0002,113,536
2Jun 2, 2026 07:542,15513,067,8974,146,0001,243,0002,113,536
3Jun 2, 2026 07:542,15613,064,5184,148,0001,244,0002,113,536
4Jun 2, 2026 07:542,15613,088,5254,147,0001,243,0002,113,536
5Jun 2, 2026 07:542,16413,088,4534,164,0001,246,0002,113,536
6Jun 2, 2026 07:542,19613,144,5724,225,0001,265,0002,113,536
7Jun 2, 2026 07:542,23613,462,4084,343,0001,248,0002,113,536
8Jun 2, 2026 07:542,26013,264,4774,393,0001,259,0002,113,536
9Jun 2, 2026 07:542,26213,224,6894,394,0001,263,0002,113,536