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 listAug 23, 2026 03:56Andrew EpsteinAndrew EpsteinScore: 1,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 03:561,85514,408,7993,504,0001,135,0002,117,632
2Aug 23, 2026 03:561,86614,451,6363,526,0001,141,0002,117,632
3Aug 23, 2026 03:561,88514,647,6773,585,0001,128,0002,117,632
4Aug 23, 2026 03:561,91914,576,4133,580,0001,218,0002,117,632
5Aug 23, 2026 03:561,92814,592,9733,595,0001,226,0002,117,632
6Aug 23, 2026 03:561,93115,722,9853,604,0001,225,0002,117,632
7Aug 23, 2026 03:561,93415,844,0753,609,0001,226,0002,117,632
8Aug 23, 2026 03:561,93514,571,2893,621,0001,217,0002,117,632
9Aug 23, 2026 03:561,93814,610,2953,616,0001,231,0002,117,632