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 23, 2025 06:48AnSaAnSaScore: 1,168,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 06:481,167,7592,949,961,3472,917,399,0001,998,0002,289,664
2Dec 23, 2025 06:481,168,5222,945,920,6872,919,307,0001,998,0002,281,472
3Dec 23, 2025 06:481,169,0802,946,348,4782,920,702,0001,999,0002,453,504