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 listFeb 5, 2026 14:32Josu San MartinJosu San MartinScore: 5,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 14:325,22728,191,11910,052,0003,015,0002,527,232
2Feb 5, 2026 14:325,23525,321,10111,074,0002,013,0002,396,160
3Feb 5, 2026 14:325,25837,524,34910,113,0003,033,0002,527,232
4Feb 5, 2026 14:325,26025,733,75711,128,0002,023,0002,387,968
5Feb 5, 2026 14:325,27331,253,7119,127,0004,056,0002,527,232
6Feb 5, 2026 14:325,27330,263,0089,127,0004,056,0002,527,232
7Feb 5, 2026 14:325,27427,593,74210,143,0003,042,0002,527,232
8Feb 5, 2026 14:325,29433,892,56710,181,0003,054,0002,281,472
9Feb 5, 2026 14:325,34429,539,30210,276,0003,083,0002,473,984