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 17, 2026 20:12Andrew EpsteinAndrew EpsteinScore: 1,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 20:241,38312,230,1683,459,00002,117,632
2Sep 17, 2026 20:241,42312,840,5523,559,00002,117,632
3Sep 17, 2026 20:241,42412,816,4063,561,00002,117,632
4Sep 17, 2026 20:241,42512,877,2632,560,0001,004,0002,117,632
5Sep 17, 2026 20:241,42512,852,0213,563,00002,117,632
6Sep 17, 2026 20:241,42712,972,1213,569,00002,117,632
7Sep 17, 2026 20:241,43012,886,9742,572,0001,005,0002,117,632
8Sep 17, 2026 20:241,43112,888,1902,570,0001,009,0002,117,632
9Sep 17, 2026 20:241,43412,901,9662,575,0001,010,0002,117,632