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 16, 2026 00:17Josu San MartinJosu San MartinScore: 2,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 00:172,74615,562,2935,763,0001,104,0002,117,632
2Sep 16, 2026 00:172,75315,691,5545,777,0001,107,0002,117,632
3Sep 16, 2026 00:172,75315,534,1195,778,0001,106,0002,117,632
4Sep 16, 2026 00:172,76415,561,1785,802,0001,110,0002,117,632
5Sep 16, 2026 00:172,80415,446,0955,899,0001,113,0002,117,632
6Sep 16, 2026 00:172,82915,740,8465,952,0001,122,0002,117,632
7Sep 16, 2026 00:172,83215,736,4005,957,0001,123,0002,117,632
8Sep 16, 2026 00:172,85316,420,0846,004,0001,130,0002,117,632
9Sep 16, 2026 00:172,85615,838,4756,006,0001,135,0002,117,632