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 30, 2026 20:44Victor MerckléVictor MerckléScore: 2,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:492,03713,448,1433,355,0001,738,0002,146,304stderr
2Aug 30, 2026 20:492,03813,533,2572,662,0002,434,0002,146,304stderr
3Aug 30, 2026 20:492,04013,559,7933,383,0001,718,0002,146,304stderr
4Aug 30, 2026 20:492,04413,559,9583,383,0001,727,0002,146,304stderr
5Aug 30, 2026 20:492,05913,615,4583,427,0001,722,0002,146,304stderr
6Aug 30, 2026 20:492,06613,601,4033,431,0001,734,0002,146,304stderr
7Aug 30, 2026 20:492,06813,501,5442,717,0002,455,0002,146,304stderr
8Aug 30, 2026 20:492,10013,662,8552,665,0002,587,0002,146,304stderr
9Aug 30, 2026 20:492,10414,928,4042,771,0002,490,0002,146,304stderr