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:55Victor MerckléVictor MerckléScore: 3,052Success
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:562,82116,922,8684,397,0002,656,0002,142,208
2Jun 27, 2026 00:562,89017,132,6014,581,0002,644,0002,142,208
3Jun 27, 2026 00:563,01617,381,2015,205,0002,337,0002,142,208
4Jun 27, 2026 00:563,04616,600,6244,999,0002,616,0002,142,208
5Jun 27, 2026 00:563,05216,296,1295,119,0002,513,0002,138,112
6Jun 27, 2026 00:563,05217,456,6265,205,0002,427,0002,138,112
7Jun 27, 2026 00:563,05715,578,3565,131,0002,513,0002,142,208
8Jun 27, 2026 00:563,05819,112,4814,926,0002,719,0002,142,208
9Jun 27, 2026 00:563,09518,663,6304,984,0002,754,0002,142,208