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 listMar 15, 2026 06:06Elijah KinElijah KinScore: 12,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 06:0612,59852,633,86229,464,0002,032,0002,293,760
2Mar 15, 2026 06:0612,83557,712,41626,072,0006,016,0002,506,752
3Mar 15, 2026 06:0612,90355,528,71828,225,0004,032,0002,379,776