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 24, 2026 02:01Andrew EpsteinAndrew EpsteinScore: 1,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 02:011,62113,744,9443,001,0001,052,0002,117,632
2Aug 24, 2026 02:011,62713,842,4223,024,0001,045,0002,117,632
3Aug 24, 2026 02:011,64813,850,2732,999,0001,123,0002,117,632
4Aug 24, 2026 02:011,65213,941,2523,009,0001,122,0002,117,632
5Aug 24, 2026 02:011,65313,859,1503,016,0001,118,0002,117,632
6Aug 24, 2026 02:011,65814,535,4973,011,0001,135,0002,117,632
7Aug 24, 2026 02:011,65813,855,4783,017,0001,129,0002,117,632
8Aug 24, 2026 02:011,66113,849,9913,018,0001,135,0002,117,632
9Aug 24, 2026 02:011,66413,857,6793,031,0001,130,0002,117,632