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 listJun 10, 2026 18:00Victor MerckléVictor MerckléScore: 3,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 18:013,00016,149,8185,032,0002,469,0002,142,208
2Jun 10, 2026 18:013,07816,061,8185,178,0002,517,0002,142,208
3Jun 10, 2026 18:013,10015,260,3155,168,0002,584,0002,142,208
4Jun 10, 2026 18:013,25015,651,0745,604,0002,523,0002,142,208
5Jun 10, 2026 18:013,25917,425,6055,633,0002,515,0002,138,112
6Jun 10, 2026 18:013,28017,666,2085,898,0002,303,0002,138,112
7Jun 10, 2026 18:013,37417,506,1315,351,0003,084,0002,142,208
8Jun 10, 2026 18:013,37618,362,7866,052,0002,388,0002,142,208
9Jun 10, 2026 18:013,38017,625,4496,118,0002,332,0002,142,208