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 listAug 27, 2026 22:26Elijah KinElijah KinScore: 2,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 22:272,02814,919,9013,834,0001,237,0002,117,632
2Aug 27, 2026 22:272,19115,185,1784,226,0001,253,0002,117,632
3Aug 27, 2026 22:272,20515,298,5994,249,0001,264,0002,117,632
4Aug 27, 2026 22:272,27415,449,3774,416,0001,271,0002,117,632
5Aug 27, 2026 22:272,30915,507,7704,531,0001,243,0002,117,632
6Aug 27, 2026 22:272,32516,336,6944,573,0001,240,0002,117,632
7Aug 27, 2026 22:272,33015,665,3164,582,0001,245,0002,117,632
8Aug 27, 2026 22:272,34616,356,4384,607,0001,260,0002,117,632
9Aug 27, 2026 22:272,35015,748,6034,774,0001,101,0002,117,632