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 30, 2025 05:25Josu San MartinJosu San MartinScore: 31,826Success
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 05:4631,697109,771,28871,219,0008,024,0002,502,656
2Dec 30, 2025 05:2531,707105,076,35070,238,0009,030,0002,486,272
3Dec 23, 2025 05:4631,772103,879,26572,392,0007,038,0002,461,696
4Dec 30, 2025 05:2531,826110,082,32472,514,0007,050,0002,289,664
5Dec 30, 2025 05:2531,935109,337,39470,856,0008,981,0002,514,944
6Dec 23, 2025 05:4632,052105,573,01571,116,0009,014,0002,514,944