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 4, 2026 01:30Victor MerckléVictor MerckléScore: 2,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 01:322,61216,084,4003,941,0002,589,0002,146,304stderr
2Aug 4, 2026 01:322,61716,929,0394,119,0002,425,0002,146,304stderr
3Aug 4, 2026 01:322,75717,202,7974,447,0002,446,0002,146,304stderr
4Aug 4, 2026 01:322,77417,710,4444,346,0002,591,0002,146,304stderr
5Aug 4, 2026 01:322,83017,867,1864,871,0002,206,0002,146,304stderr
6Aug 4, 2026 01:322,84117,756,1414,872,0002,232,0002,142,208stderr
7Aug 4, 2026 01:322,87517,445,8524,933,0002,256,0002,146,304stderr
8Aug 4, 2026 01:322,89519,010,9384,923,0002,316,0002,146,304stderr
9Aug 4, 2026 01:322,90017,791,2254,683,0002,568,0002,146,304stderr