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 21:05Elijah KinElijah KinScore: 3,132Success
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 21:062,62016,266,9604,414,0002,137,0002,117,632
2Aug 27, 2026 21:062,64016,481,8034,439,0002,163,0002,117,632
3Aug 27, 2026 21:062,68816,552,9234,406,0002,315,0002,117,632
4Aug 27, 2026 21:063,11018,300,7425,507,0002,269,0002,117,632
5Aug 27, 2026 21:063,13217,814,5505,579,0002,252,0002,117,632
6Aug 27, 2026 21:063,14318,001,2155,595,0002,264,0002,117,632
7Aug 27, 2026 21:063,16417,982,9165,554,0002,356,0002,117,632
8Aug 27, 2026 21:063,16717,988,4875,656,0002,263,0002,117,632
9Aug 27, 2026 21:063,22517,762,2485,790,0002,274,0002,117,632