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 listMar 4, 2026 18:57olliecrowolliecrowScore: 18,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 18:5718,35374,848,66441,894,0003,989,0002,416,640
2Mar 4, 2026 18:5718,37072,810,90241,932,0003,993,0002,383,872
3Mar 4, 2026 18:5718,37570,198,85640,945,0004,993,0002,514,944
4Mar 4, 2026 18:5718,39771,412,90243,993,0001,999,0002,392,064
5Mar 4, 2026 18:5718,39876,102,15940,997,0004,999,0002,396,160
6Mar 4, 2026 18:5718,40972,784,84743,022,0003,001,0002,396,160
7Mar 4, 2026 18:5718,44073,699,65043,093,0003,006,0002,396,160
8Mar 4, 2026 18:5718,45170,833,56343,119,0003,008,0002,363,392
9Mar 4, 2026 18:5718,47376,309,89641,163,0005,019,0002,334,720