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 15, 2026 22:34Josu San MartinJosu San MartinScore: 2,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 22:352,75115,548,5865,771,0001,108,0002,117,632
2Sep 15, 2026 22:352,75215,542,8715,774,0001,108,0002,117,632
3Sep 15, 2026 22:352,75415,339,8145,779,0001,107,0002,117,632
4Sep 15, 2026 22:352,75615,479,2275,783,0001,109,0002,117,632
5Sep 15, 2026 22:352,76615,486,3975,803,0001,112,0002,117,632
6Sep 15, 2026 22:352,76915,635,9245,810,0001,114,0002,117,632
7Sep 15, 2026 22:352,81415,673,5095,902,0001,133,0002,117,632
8Sep 15, 2026 22:352,83515,738,6035,963,0001,126,0002,117,632
9Sep 15, 2026 22:352,84415,718,0565,982,0001,128,0002,117,632