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 26, 2026 18:16Kevin HeaveyKevin HeaveyScore: 1,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:191,16411,469,7482,910,0000524,288
2Sep 26, 2026 18:191,25011,777,4843,125,0000524,288
3Sep 26, 2026 18:191,25811,801,7153,147,0000524,288
4Sep 26, 2026 18:191,25911,569,0713,148,0000524,288
5Sep 26, 2026 18:191,26211,736,5753,157,0000524,288
6Sep 26, 2026 18:191,26711,596,1233,168,0000524,288
7Sep 26, 2026 18:191,26711,636,3103,168,0000524,288
8Sep 26, 2026 18:191,26811,629,5633,171,0000524,288
9Sep 26, 2026 18:191,27011,697,5633,177,0000524,288