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 5, 2026 14:13Victor MerckléVictor MerckléScore: 3,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 14:243,13823,552,9896,633,0001,213,0002,457,600
2May 5, 2026 14:243,14023,394,2426,637,0001,213,0002,445,312
3May 5, 2026 14:243,17521,815,6956,731,0001,207,0002,457,600
4May 5, 2026 14:243,19925,649,7125,841,0002,158,0002,445,312
5May 5, 2026 14:243,24220,379,8936,887,0001,219,0002,449,408
6May 5, 2026 14:243,26323,952,5446,950,0001,208,0002,461,696
7May 5, 2026 14:243,27620,399,0746,979,0001,211,0002,445,312
8May 5, 2026 14:243,28220,391,9156,997,0001,209,0002,445,312
9May 5, 2026 14:243,30625,457,8936,121,0002,146,0002,449,408