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 09:26Victor MerckléVictor MerckléScore: 1,524Success
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 09:321,39612,282,3952,399,0001,093,0002,117,632stderr
2Sep 15, 2026 09:321,50612,517,6502,619,0001,146,0002,117,632stderr
3Sep 15, 2026 09:321,51013,186,7412,638,0001,138,0002,117,632stderr
4Sep 15, 2026 09:321,52313,311,5712,653,0001,156,0002,117,632stderr
5Sep 15, 2026 09:321,52413,928,0002,650,0001,160,0002,117,632stderr
6Sep 15, 2026 09:321,53312,708,7932,678,0001,155,0002,117,632stderr
7Sep 15, 2026 09:321,56812,386,9222,629,0001,292,0002,117,632stderr
8Sep 15, 2026 09:321,57012,633,4112,776,0001,149,0002,117,632stderr
9Sep 15, 2026 09:321,62912,987,0792,899,0001,174,0002,117,632stderr