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 30, 2026 19:16Victor MerckléVictor MerckléScore: 1,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 19:181,62712,020,8172,923,0001,145,0002,117,632stderr
2Jun 30, 2026 19:181,63712,246,4592,938,0001,155,0002,117,632stderr
3Jun 30, 2026 19:181,64311,973,0312,940,0001,169,0002,117,632stderr
4Jun 30, 2026 19:181,65512,094,2622,954,0001,184,0002,117,632stderr
5Jun 30, 2026 19:181,68412,178,6563,006,0001,205,0002,117,632stderr
6Jun 30, 2026 19:181,68912,425,9912,962,0001,262,0002,117,632stderr
7Jun 30, 2026 19:181,73512,247,4633,142,0001,196,0002,117,632stderr
8Jun 30, 2026 19:181,74012,327,7103,132,0001,219,0002,117,632stderr
9Jun 30, 2026 19:181,75012,660,7563,157,0001,219,0002,117,632stderr