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 16:57Elijah KinElijah KinScore: 2,244Success
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 16:582,02114,916,7103,798,0001,256,0002,117,632
2Aug 27, 2026 16:582,18215,145,3134,202,0001,253,0002,117,632
3Aug 27, 2026 16:582,20015,223,8144,251,0001,251,0002,117,632
4Aug 27, 2026 16:582,22415,401,3424,277,0001,283,0002,117,632
5Aug 27, 2026 16:582,24415,911,2494,359,0001,251,0002,117,632
6Aug 27, 2026 16:582,27016,235,0504,434,0001,242,0002,117,632
7Aug 27, 2026 16:582,28015,487,1944,442,0001,258,0002,117,632
8Aug 27, 2026 16:582,28515,561,1974,459,0001,254,0002,117,632
9Aug 27, 2026 16:582,37627,436,6074,843,0001,098,0002,117,632