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 listAug 19, 2026 00:30Victor MerckléVictor MerckléScore: 2,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 00:332,86417,467,2994,829,0002,331,0002,142,208stderr
2Aug 19, 2026 00:332,89017,013,3954,874,0002,351,0002,142,208stderr
3Aug 19, 2026 00:332,89616,863,5364,961,0002,280,0002,142,208stderr
4Aug 19, 2026 00:332,90317,363,6655,030,0002,229,0002,142,208stderr
5Aug 19, 2026 00:332,90616,982,4665,037,0002,230,0002,142,208stderr
6Aug 19, 2026 00:332,92516,971,3365,089,0002,224,0002,142,208stderr
7Aug 19, 2026 00:332,93217,051,0404,288,0003,042,0002,191,360stderr
8Aug 19, 2026 00:332,93217,410,6305,033,0002,298,0002,142,208stderr
9Aug 19, 2026 00:332,97617,094,7915,036,0002,406,0002,142,208stderr