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 1, 2026 09:45Victor MerckléVictor MerckléScore: 2,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 09:472,55613,965,5385,062,0001,329,0002,113,536
2Jun 1, 2026 09:472,56813,977,7865,088,0001,333,0002,113,536
3Jun 1, 2026 09:472,57013,996,9705,093,0001,333,0002,113,536
4Jun 1, 2026 09:472,63414,156,0845,258,0001,328,0002,113,536
5Jun 1, 2026 09:472,65814,286,7945,318,0001,328,0002,113,536
6Jun 1, 2026 09:472,67414,114,8865,355,0001,330,0002,113,536
7Jun 1, 2026 09:472,67814,233,4235,358,0001,339,0002,113,536
8Jun 1, 2026 09:472,67814,189,6275,362,0001,333,0002,113,536
9Jun 1, 2026 09:472,68214,246,2525,379,0001,327,0002,113,536