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 listSep 14, 2026 21:00Victor MerckléVictor MerckléScore: 1,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 21:111,33912,189,2581,841,0001,508,0002,117,632stderr
2Sep 14, 2026 21:111,35612,077,8751,853,0001,539,0002,117,632stderr
3Sep 14, 2026 21:111,37212,196,9511,886,0001,544,0002,117,632stderr
4Sep 14, 2026 21:111,37312,182,0881,890,0001,543,0002,117,632stderr
5Sep 14, 2026 21:111,37412,158,5271,894,0001,541,0002,117,632stderr
6Sep 14, 2026 21:111,38212,181,7651,889,0001,566,0002,117,632stderr
7Sep 14, 2026 21:111,38312,113,8241,895,0001,563,0002,117,632stderr
8Sep 14, 2026 21:111,39112,257,4121,910,0001,569,0002,117,632stderr
9Sep 14, 2026 21:111,42412,162,4561,943,0001,619,0002,117,632stderr