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 05:26Victor MerckléVictor MerckléScore: 1,411Success
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 05:271,34812,178,3081,836,0001,535,0002,117,632stderr
2Sep 15, 2026 05:271,38012,133,8061,895,0001,557,0002,117,632stderr
3Sep 15, 2026 05:271,38412,129,8281,905,0001,556,0002,117,632stderr
4Sep 15, 2026 05:271,38812,195,4561,909,0001,562,0002,117,632stderr
5Sep 15, 2026 05:271,41112,461,6311,975,0001,553,0002,117,632stderr
6Sep 15, 2026 05:271,44812,417,1632,043,0001,578,0002,117,632stderr
7Sep 15, 2026 05:271,45812,351,0542,059,0001,586,0002,117,632stderr
8Sep 15, 2026 05:271,48213,172,1852,120,0001,586,0002,117,632stderr
9Sep 15, 2026 05:271,49413,080,4092,162,0001,573,0002,117,632stderr