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 29, 2026 23:33Victor MerckléVictor MerckléScore: 2,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:342,53015,614,2674,998,0001,329,0002,113,536
2May 29, 2026 23:342,53415,924,1675,006,0001,331,0002,113,536
3May 29, 2026 23:342,53915,508,8405,015,0001,333,0002,113,536
4May 29, 2026 23:342,54014,740,6415,022,0001,328,0002,113,536
5May 29, 2026 23:342,54815,924,2295,037,0001,333,0002,113,536
6May 29, 2026 23:342,56215,468,4705,060,0001,347,0002,113,536
7May 29, 2026 23:342,64316,032,7045,281,0001,328,0002,113,536
8May 29, 2026 23:342,65415,990,9955,287,0001,348,0002,113,536
9May 29, 2026 23:342,65415,062,6715,294,0001,342,0002,113,536