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 20:52Elijah KinElijah KinScore: 2,292Success
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 20:532,06815,083,3033,925,0001,247,0002,117,632
2Aug 27, 2026 20:532,09115,045,0803,932,0001,296,0002,117,632
3Aug 27, 2026 20:532,23415,281,0354,325,0001,260,0002,117,632
4Aug 27, 2026 20:532,29115,647,6634,464,0001,265,0002,117,632
5Aug 27, 2026 20:532,29215,678,2534,469,0001,262,0002,117,632
6Aug 27, 2026 20:532,32815,599,3874,558,0001,262,0002,117,632
7Aug 27, 2026 20:532,34615,593,4544,628,0001,239,0002,117,632
8Aug 27, 2026 20:532,34615,709,4034,606,0001,261,0002,117,632
9Aug 27, 2026 20:532,35715,793,8194,643,0001,250,0002,117,632