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 listOct 17, 2026 07:34janwwwjanwwwScore: 1,611Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 29, 2026 22:13Andrew Epstein19.77CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 07:351,53912,969,5302,814,0001,034,0002,113,536
2Oct 17, 2026 07:351,56712,869,5562,874,0001,045,0002,113,536
3Oct 17, 2026 07:351,57112,845,0362,878,0001,050,0002,113,536
4Oct 17, 2026 07:351,57113,024,6162,879,0001,050,0002,113,536
5Oct 17, 2026 07:351,61113,005,9782,983,0001,045,0002,113,536
6Oct 17, 2026 07:351,65713,128,6143,031,0001,113,0002,113,536
7Oct 17, 2026 07:351,66813,103,6263,122,0001,050,0002,113,536
8Oct 17, 2026 07:351,70313,310,7253,010,0001,249,0002,113,536
9Oct 17, 2026 07:351,72513,169,3103,187,0001,127,0002,113,536