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 listSep 14, 2026 00:42Andrew EpsteinAndrew EpsteinScore: 1,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:431,35511,873,6593,389,00002,117,632
2Sep 14, 2026 00:431,35711,874,6133,394,00002,117,632
3Sep 14, 2026 00:431,46412,072,4003,661,00002,117,632
4Sep 14, 2026 00:431,50412,291,9993,761,00002,117,632
5Sep 14, 2026 00:431,50412,171,9873,762,00002,117,632
6Sep 14, 2026 00:431,50512,194,4472,757,0001,007,0002,117,632
7Sep 14, 2026 00:431,50812,318,7802,758,0001,013,0002,117,632
8Sep 14, 2026 00:431,51012,168,8142,767,0001,008,0002,117,632
9Sep 14, 2026 00:431,51212,131,6292,768,0001,013,0002,117,632