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 29, 2025 16:01Josu San MartinJosu San MartinScore: 27,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 16:0127,27699,972,66162,174,0006,016,0002,322,432
2Dec 29, 2025 16:0127,30297,770,70861,228,0007,026,0002,273,280
3Dec 29, 2025 16:0128,501100,633,85461,217,00010,035,0002,514,944