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 listMay 18, 2026 07:22Jacob McDanielJacob McDanielScore: 2,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 07:332,70616,678,7795,557,0001,210,0002,117,632
2May 18, 2026 07:332,74217,884,8275,612,0001,243,0002,117,632
3May 18, 2026 07:332,78217,276,8105,686,0001,269,0002,117,632
4May 18, 2026 07:332,80018,351,7815,714,0001,288,0002,117,632
5May 18, 2026 07:332,80917,530,2385,764,0001,259,0002,117,632
6May 18, 2026 07:332,80919,128,6335,768,0001,256,0002,117,632
7May 18, 2026 07:332,81117,473,0385,767,0001,261,0002,117,632
8May 18, 2026 07:332,82417,071,3305,786,0001,275,0002,117,632
9May 18, 2026 07:332,85417,957,0105,863,0001,272,0002,117,632