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 listMay 10, 2025 13:57KeefeKeefeScore: 18,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2025 13:5717,65067,815,95034,096,00010,028,0002,437,120
2May 10, 2025 13:5717,73870,406,53838,299,0006,047,0002,519,040
3May 10, 2025 13:5717,96173,782,76433,927,00010,976,0002,342,912
4May 10, 2025 13:5718,18277,810,86939,394,0006,060,0002,510,848
5May 10, 2025 13:5718,47573,974,04139,159,0007,028,0002,306,048
6May 10, 2025 13:5718,55476,977,34837,311,0009,075,0002,506,752
7May 10, 2025 13:5718,77176,843,40038,940,0007,987,0002,473,984
8May 10, 2025 13:5718,83475,685,95038,068,0009,016,0002,338,816
9May 10, 2025 13:5718,95072,723,55038,304,0009,072,0002,506,752