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 listMar 4, 2026 17:58olliecrowolliecrowScore: 24,371Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 17:5824,35385,915,10258,886,0001,996,0002,314,240
2Mar 4, 2026 17:5824,35694,712,72956,897,0003,992,0002,293,760
3Mar 4, 2026 17:5824,36488,626,87557,866,0003,045,0002,408,448
4Mar 4, 2026 17:5824,36581,624,44458,915,0001,997,0002,408,448
5Mar 4, 2026 17:5824,37188,609,84557,931,0002,996,0002,510,848
6Mar 4, 2026 17:5824,40994,064,07657,022,0004,001,0002,400,256
7Mar 4, 2026 17:5824,44787,696,10856,108,0005,009,0002,314,240
8Mar 4, 2026 17:5824,53382,494,49258,316,0003,016,0002,412,544
9Mar 4, 2026 17:5824,64783,836,66657,578,0004,040,0002,514,944