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 2, 2026 11:17Victor MerckléVictor MerckléScore: 2,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 11:192,14813,004,1134,129,0001,242,0002,113,536
2Jun 2, 2026 11:192,14813,040,5994,133,0001,239,0002,113,536
3Jun 2, 2026 11:192,15813,051,5284,153,0001,242,0002,113,536
4Jun 2, 2026 11:192,16813,080,3204,171,0001,249,0002,113,536
5Jun 2, 2026 11:192,18713,096,2084,202,0001,267,0002,113,536
6Jun 2, 2026 11:192,21013,130,2204,290,0001,237,0002,113,536
7Jun 2, 2026 11:192,21113,155,2894,286,0001,243,0002,113,536
8Jun 2, 2026 11:192,21913,203,2064,279,0001,270,0002,113,536
9Jun 2, 2026 11:192,23813,204,9134,347,0001,250,0002,113,536