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 listApr 26, 2026 00:35olliecrowolliecrowScore: 4,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 00:384,24931,868,7559,561,0001,062,0002,371,584
2Apr 26, 2026 00:384,27429,642,6218,549,0002,137,0002,465,792
3Apr 26, 2026 00:384,27628,339,3299,623,0001,069,0002,392,064
4Apr 26, 2026 00:384,32727,728,5375,901,0004,917,0002,351,104
5Apr 26, 2026 00:384,35928,203,7587,926,0002,972,0002,392,064
6Apr 26, 2026 00:384,36830,330,6196,949,0003,971,0002,396,160
7Apr 26, 2026 00:384,53830,501,3959,284,0002,063,0002,392,064
8Apr 26, 2026 00:384,55431,441,3647,245,0004,140,0002,392,064
9Apr 26, 2026 00:384,69229,035,9549,599,0002,133,0002,396,160