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 19, 2026 19:27Elijah KinElijah KinScore: 2,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:282,03715,237,7503,838,0001,256,0002,117,632
2Sep 19, 2026 19:282,14815,501,7144,106,0001,265,0002,117,632
3Sep 19, 2026 19:282,27015,801,8644,413,0001,264,0002,117,632
4Sep 19, 2026 19:282,27115,966,0784,386,0001,293,0002,117,632
5Sep 19, 2026 19:282,28415,892,7404,424,0001,287,0002,117,632
6Sep 19, 2026 19:282,28416,598,6234,439,0001,272,0002,117,632
7Sep 19, 2026 19:282,30016,680,5884,484,0001,266,0002,117,632
8Sep 19, 2026 19:282,31216,075,0294,504,0001,277,0002,117,632
9Sep 19, 2026 19:282,33615,999,4304,569,0001,273,0002,117,632