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 27, 2026 00:24Victor MerckléVictor MerckléScore: 2,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 00:252,83214,762,3874,539,0002,541,0002,138,112
2Jun 27, 2026 00:252,83816,918,4074,509,0002,587,0002,142,208
3Jun 27, 2026 00:252,84817,041,9884,775,0002,345,0002,142,208
4Jun 27, 2026 00:252,85617,068,7824,432,0002,710,0002,142,208
5Jun 27, 2026 00:252,86814,852,9304,535,0002,635,0002,142,208
6Jun 27, 2026 00:252,88617,259,1234,923,0002,292,0002,142,208
7Jun 27, 2026 00:253,04415,216,3435,098,0002,514,0002,142,208
8Jun 27, 2026 00:253,13117,982,6025,119,0002,709,0002,142,208
9Jun 27, 2026 00:253,15617,869,2205,270,0002,622,0002,138,112