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 15, 2026 00:36Victor MerckléVictor MerckléScore: 1,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 00:361,35212,107,6461,848,0001,533,0002,117,632stderr
2Sep 15, 2026 00:361,39712,066,0711,903,0001,590,0002,117,632stderr
3Sep 15, 2026 00:361,41412,133,8571,943,0001,592,0002,117,632stderr
4Sep 15, 2026 00:361,47412,666,4552,113,0001,572,0002,117,632stderr
5Sep 15, 2026 00:361,47812,276,8902,530,0001,165,0002,117,632stderr
6Sep 15, 2026 00:361,48612,402,0842,156,0001,561,0002,117,632stderr
7Sep 15, 2026 00:361,49013,120,7142,171,0001,556,0002,117,632stderr
8Sep 15, 2026 00:361,49212,382,0562,149,0001,583,0002,117,632stderr
9Sep 15, 2026 00:361,49612,260,1272,570,0001,172,0002,117,632stderr