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 18, 2026 22:43Charles CabergsCharles CabergsScore: 12,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 22:4312,82254,693,29723,039,0009,015,0002,293,760
2Apr 18, 2026 22:4312,82957,810,45722,050,00010,022,0002,461,696
3Apr 18, 2026 22:4312,84060,545,40921,066,00011,034,0002,461,696
4Apr 18, 2026 22:4312,84856,858,55823,087,0009,034,0002,510,848
5Apr 18, 2026 22:4312,86561,356,86622,112,00010,051,0002,494,464
6Apr 18, 2026 22:4312,98856,964,35323,338,0009,132,0002,461,696
7Apr 18, 2026 22:4312,99557,016,63222,335,00010,152,0002,281,472
8Apr 18, 2026 22:4313,05465,512,90224,477,0008,159,0002,457,600
9Apr 18, 2026 22:4313,30761,571,44620,162,00013,105,0002,506,752