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 17, 2026 20:04Andrew EpsteinAndrew EpsteinScore: 1,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 20:071,28712,612,2333,219,00002,117,632
2Sep 17, 2026 20:071,28913,514,4953,224,00002,117,632
3Sep 17, 2026 20:071,29014,043,3393,227,00002,117,632
4Sep 17, 2026 20:071,29913,622,7253,249,00002,117,632
5Sep 17, 2026 20:071,29914,002,8233,249,00002,117,632
6Sep 17, 2026 20:071,38113,914,8943,453,00002,117,632
7Sep 17, 2026 20:071,38414,045,0383,461,00002,117,632
8Sep 17, 2026 20:071,38513,894,5213,463,00002,117,632
9Sep 17, 2026 20:071,40513,547,7613,513,00002,117,632