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 13, 2026 18:48Victor MerckléVictor MerckléScore: 57,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 18:4856,646150,728,113138,359,0003,256,0002,117,632
2Jun 13, 2026 18:4856,975151,503,154138,387,0004,052,0002,117,632
3Jun 13, 2026 18:4856,980151,475,126139,416,0003,036,0002,117,632
4Jun 13, 2026 18:4857,010151,598,850138,481,0004,046,0002,117,632
5Jun 13, 2026 18:4857,045151,891,900139,577,0003,036,0002,117,632
6Jun 13, 2026 18:4857,092151,807,960139,695,0003,037,0002,117,632
7Jun 13, 2026 18:4857,190152,073,323139,937,0003,038,0002,117,632
8Jun 13, 2026 18:4857,216153,473,874140,005,0003,035,0002,117,632
9Jun 13, 2026 18:4857,296152,372,052140,204,0003,037,0002,117,632