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 27, 2026 18:29Elijah KinElijah KinScore: 6,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2026 18:316,41725,240,64312,749,0003,295,0002,113,536
2May 27, 2026 18:316,52427,668,92512,898,0003,414,0002,113,536
3May 27, 2026 18:316,54026,955,53513,044,0003,308,0002,113,536
4May 27, 2026 18:316,56427,242,99913,160,0003,250,0002,113,536
5May 27, 2026 18:316,62928,967,80313,293,0003,281,0002,113,536
6May 27, 2026 18:316,65325,782,78613,300,0003,333,0002,113,536
7May 27, 2026 18:316,70228,933,06613,442,0003,314,0002,113,536
8May 27, 2026 18:316,73426,661,93013,397,0003,440,0002,113,536
9May 27, 2026 18:316,78330,355,63813,671,0003,288,0002,113,536