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 listSep 19, 2026 18:35Elijah KinElijah KinScore: 2,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:361,98115,076,9533,699,0001,255,0002,117,632
2Sep 19, 2026 18:361,98115,070,1053,709,0001,244,0002,117,632
3Sep 19, 2026 18:362,00315,144,1043,729,0001,279,0002,117,632
4Sep 19, 2026 18:362,13715,492,5614,057,0001,287,0002,117,632
5Sep 19, 2026 18:362,17415,545,0644,176,0001,259,0002,117,632
6Sep 19, 2026 18:362,18415,507,1284,179,0001,283,0002,117,632
7Sep 19, 2026 18:362,21415,712,2934,271,0001,264,0002,117,632
8Sep 19, 2026 18:362,24715,788,9184,357,0001,262,0002,117,632
9Sep 19, 2026 18:362,26315,761,5504,382,0001,277,0002,117,632