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:57Victor MerckléVictor MerckléScore: 1,444Success
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 01:041,33412,080,1601,852,0001,483,0002,117,632stderr
2Sep 15, 2026 01:041,35312,169,9282,301,0001,082,0002,117,632stderr
3Sep 15, 2026 01:041,35412,101,8631,868,0001,519,0002,117,632stderr
4Sep 15, 2026 01:041,41312,351,7791,996,0001,537,0002,117,632stderr
5Sep 15, 2026 01:041,44413,033,8432,088,0001,522,0002,117,632stderr
6Sep 15, 2026 01:041,46012,769,9052,131,0001,521,0002,117,632stderr
7Sep 15, 2026 01:041,46712,361,5332,141,0001,527,0002,117,632stderr
8Sep 15, 2026 01:041,47012,370,3272,134,0001,542,0002,117,632stderr
9Sep 15, 2026 01:041,51812,448,3052,102,0001,695,0002,117,632stderr