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 5, 2026 03:51olliecrowolliecrowScore: 4,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 03:533,98224,275,5788,457,0001,500,0002,351,104
2May 5, 2026 03:534,02528,801,9688,540,0001,523,0002,347,008
3May 5, 2026 03:534,02625,824,5848,655,0001,412,0002,342,912
4May 5, 2026 03:534,03027,507,6228,538,0001,538,0002,347,008
5May 5, 2026 03:534,03026,066,7238,543,0001,533,0002,347,008
6May 5, 2026 03:534,20427,571,4339,224,0001,288,0002,342,912
7May 5, 2026 03:534,20729,479,0809,219,0001,299,0002,355,200
8May 5, 2026 03:534,25425,579,5259,341,0001,294,0002,351,104
9May 5, 2026 03:534,25428,669,0599,318,0001,317,0002,359,296