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 20, 2026 14:28Victor MerckléVictor MerckléScore: 2,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:302,70816,073,5225,424,0001,346,0002,113,536
2May 20, 2026 14:302,70814,552,1535,424,0001,348,0002,113,536
3May 20, 2026 14:302,71015,159,9565,430,0001,347,0002,113,536
4May 20, 2026 14:302,71114,506,3085,427,0001,351,0002,113,536
5May 20, 2026 14:302,71915,104,0265,447,0001,351,0002,113,536
6May 20, 2026 14:302,72816,021,3295,469,0001,353,0002,113,536
7May 20, 2026 14:302,83216,513,1085,739,0001,342,0002,113,536
8May 20, 2026 14:302,83914,899,2985,755,0001,344,0002,113,536
9May 20, 2026 14:302,86114,919,1335,794,0001,360,0002,113,536