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 listDec 29, 2025 16:05Josu San MartinJosu San MartinScore: 27,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 16:0527,40394,640,30560,449,0008,059,0002,338,816
2Dec 29, 2025 16:0527,54094,806,16959,869,0008,980,0002,519,040
3Dec 29, 2025 16:0528,34797,780,31460,886,0009,981,0002,514,944