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 8, 2026 19:09Victor MerckléVictor MerckléScore: 3,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 19:093,44916,310,9296,202,0002,422,0002,113,536
2Jun 8, 2026 19:093,53316,906,4716,371,0002,463,0002,113,536
3Jun 8, 2026 19:093,54216,354,6146,379,0002,478,0002,113,536
4Jun 8, 2026 19:093,55216,578,2276,417,0002,465,0002,113,536
5Jun 8, 2026 19:093,58619,689,1286,497,0002,468,0002,113,536
6Jun 8, 2026 19:093,60116,528,3736,527,0002,477,0002,113,536
7Jun 8, 2026 19:093,61816,838,5926,597,0002,450,0002,113,536
8Jun 8, 2026 19:093,64117,163,8656,579,0002,524,0002,113,536
9Jun 8, 2026 19:093,64216,878,7386,646,0002,460,0002,113,536