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 17:31Elijah KinElijah KinScore: 2,285Success
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 17:322,01414,891,9703,787,0001,248,0002,117,632
2Aug 27, 2026 17:322,26915,379,5774,427,0001,246,0002,117,632
3Aug 27, 2026 17:322,28315,423,4674,442,0001,266,0002,117,632
4Aug 27, 2026 17:322,28416,887,1394,470,0001,241,0002,117,632
5Aug 27, 2026 17:322,28515,589,7794,453,0001,261,0002,117,632
6Aug 27, 2026 17:322,28715,505,3554,462,0001,257,0002,117,632
7Aug 27, 2026 17:322,28915,592,8154,483,0001,240,0002,117,632
8Aug 27, 2026 17:322,29215,421,6614,476,0001,254,0002,117,632
9Aug 27, 2026 17:322,32316,343,7934,545,0001,264,0002,117,632