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 listApr 13, 2026 11:43limanjun99limanjun99Score: 3,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 11:443,09627,579,1555,529,0002,211,0002,293,760
2Apr 13, 2026 11:443,16625,933,3694,947,0002,968,0002,293,760
3Apr 13, 2026 11:433,20225,678,3515,003,0003,001,0002,502,656
4Apr 13, 2026 11:433,21827,593,2575,028,0003,016,0002,293,760
5Apr 13, 2026 11:433,22324,960,0736,044,0002,014,0002,527,232
6Apr 13, 2026 11:443,23325,254,4435,052,0003,031,0002,527,232