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 14, 2026 02:56Victor MerckléVictor MerckléScore: 5,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 02:575,44822,754,57110,496,0003,124,0002,117,632
2Jun 14, 2026 02:575,45622,849,52010,522,0003,119,0002,117,632
3Jun 14, 2026 02:575,46422,833,80410,528,0003,132,0002,117,632
4Jun 14, 2026 02:575,59923,201,55010,772,0003,227,0002,117,632
5Jun 14, 2026 02:575,74823,501,04611,177,0003,195,0002,117,632
6Jun 14, 2026 02:575,99024,128,28311,835,0003,142,0002,117,632
7Jun 14, 2026 02:576,06224,348,00811,996,0003,159,0002,117,632
8Jun 14, 2026 02:576,07024,361,90312,039,0003,137,0002,117,632
9Jun 14, 2026 02:576,14024,531,61012,171,0003,180,0002,117,632