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 listJun 2, 2026 05:41Victor MerckléVictor MerckléScore: 2,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 05:422,15713,079,8674,151,0001,243,0002,113,536
2Jun 2, 2026 05:422,16313,047,0694,160,0001,248,0002,113,536
3Jun 2, 2026 05:422,17913,088,1424,190,0001,259,0002,113,536
4Jun 2, 2026 05:422,22413,209,8514,277,0001,283,0002,113,536
5Jun 2, 2026 05:422,24513,224,5274,357,0001,256,0002,113,536
6Jun 2, 2026 05:422,24713,304,6174,374,0001,245,0002,113,536
7Jun 2, 2026 05:422,25413,268,2884,389,0001,248,0002,113,536
8Jun 2, 2026 05:422,25513,278,1204,375,0001,264,0002,113,536
9Jun 2, 2026 05:422,30813,762,3723,662,0002,110,0002,113,536