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 12:28Victor MerckléVictor MerckléScore: 2,656Success
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 12:302,55016,372,8625,047,0001,328,0002,113,536
2May 29, 2026 12:302,64816,503,8605,294,0001,327,0002,113,536
3May 29, 2026 12:302,64914,364,5055,303,0001,321,0002,113,536
4May 29, 2026 12:302,65114,985,0155,309,0001,320,0002,113,536
5May 29, 2026 12:302,65614,473,1215,316,0001,325,0002,113,536
6May 29, 2026 12:302,66216,318,1995,333,0001,324,0002,113,536
7May 29, 2026 12:302,69614,476,6715,389,0001,353,0002,113,536
8May 29, 2026 12:302,71116,605,7084,508,0002,270,0002,113,536
9May 29, 2026 12:302,72614,904,0024,544,0002,273,0002,113,536