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 29, 2026 05:22Elijah KinElijah KinScore: 5,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 05:244,92722,000,5769,212,0003,107,0002,113,536
2May 29, 2026 05:244,94423,860,34210,120,0002,241,0002,113,536
3May 29, 2026 05:245,14522,368,9629,607,0003,256,0002,113,536
4May 29, 2026 05:245,23624,495,3079,931,0003,161,0002,113,536
5May 29, 2026 05:245,41623,849,33110,457,0003,084,0002,113,536
6May 29, 2026 05:245,49224,061,93510,548,0003,182,0002,113,536
7May 29, 2026 05:245,52623,582,10710,567,0003,250,0002,113,536
8May 29, 2026 05:245,55824,830,62510,662,0003,234,0002,113,536
9May 29, 2026 05:245,59523,418,77010,845,0003,143,0002,113,536