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 listDec 5, 2024 13:17Yingxin JiangYingxin JiangScore: 1,262,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2024 13:171,261,3933,181,244,6473,152,484,000999,0002,289,664
2Dec 5, 2024 13:171,261,7323,182,854,1403,153,332,000999,0002,285,568
3Dec 5, 2024 13:171,262,4643,181,479,8153,154,163,0001,998,0002,289,664
4Dec 5, 2024 13:171,262,5223,187,229,4573,153,306,0002,998,0002,281,472
5Dec 5, 2024 13:171,262,6483,183,444,1993,153,621,0002,998,0002,289,664
6Dec 5, 2024 13:171,262,9283,184,299,5263,155,323,0001,998,0002,285,568
7Dec 5, 2024 13:171,264,1403,190,482,9833,159,350,000999,0002,281,472
8Dec 5, 2024 13:171,264,4673,185,382,1423,158,169,0002,998,0002,281,472
9Dec 5, 2024 13:171,264,7163,191,704,6033,159,792,0001,999,0002,342,912