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 listMay 19, 2026 14:46Elijah KinElijah KinScore: 14,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:4814,72046,123,84833,740,0003,062,0002,113,536
2May 19, 2026 14:4814,74746,295,11933,651,0003,218,0002,113,536
3May 19, 2026 14:4814,75247,650,60633,711,0003,171,0002,113,536
4May 19, 2026 14:4814,76746,470,41533,829,0003,089,0002,113,536
5May 19, 2026 14:4814,82046,703,11133,888,0003,162,0002,113,536
6May 19, 2026 14:4814,90147,011,16434,170,0003,084,0002,113,536
7May 19, 2026 14:4814,92049,557,67234,193,0003,108,0002,113,536
8May 19, 2026 14:4814,92747,382,78533,950,0003,369,0002,113,536
9May 19, 2026 14:4814,95246,614,36234,023,0003,359,0002,113,536