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 03:05Victor MerckléVictor MerckléScore: 2,324Success
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 03:072,24013,235,7744,365,0001,235,0002,113,536
2Jun 2, 2026 03:072,24313,259,6514,373,0001,236,0002,113,536
3Jun 2, 2026 03:072,30813,413,8514,535,0001,235,0002,113,536
4Jun 2, 2026 03:072,31913,528,7914,540,0001,259,0002,113,536
5Jun 2, 2026 03:072,32413,415,5594,571,0001,240,0002,113,536
6Jun 2, 2026 03:072,33413,787,9994,593,0001,244,0002,113,536
7Jun 2, 2026 03:072,33713,849,6714,605,0001,239,0002,113,536
8Jun 2, 2026 03:072,36714,677,8694,654,0001,265,0002,113,536
9Jun 2, 2026 03:072,38413,570,7123,857,0002,105,0002,113,536