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 01:56Victor MerckléVictor MerckléScore: 3,270Success
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 02:003,05516,713,5824,468,0003,170,0002,187,264
2Jun 27, 2026 02:003,24717,143,9485,245,0002,874,0002,138,112
3Jun 27, 2026 02:003,26317,142,7945,243,0002,915,0002,129,920
4Jun 27, 2026 02:003,26517,252,2125,275,0002,888,0002,138,112
5Jun 27, 2026 02:003,27017,126,4724,447,0003,729,0002,154,496
6Jun 27, 2026 02:003,28217,254,0204,515,0003,691,0002,187,264
7Jun 27, 2026 02:003,29317,219,0334,540,0003,694,0002,154,496
8Jun 27, 2026 02:003,31617,259,6825,420,0002,870,0002,134,016
9Jun 27, 2026 02:003,32217,373,6855,417,0002,888,0002,138,112