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 19:28Victor MerckléVictor MerckléScore: 2,609Success
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 19:302,57215,045,3005,115,0001,316,0002,113,536
2May 29, 2026 19:302,58614,053,9195,151,0001,316,0002,113,536
3May 29, 2026 19:302,59114,289,2115,153,0001,326,0002,113,536
4May 29, 2026 19:302,59615,255,4905,163,0001,328,0002,113,536
5May 29, 2026 19:302,60916,106,7925,188,0001,335,0002,113,536
6May 29, 2026 19:302,63917,040,4735,284,0001,314,0002,113,536
7May 29, 2026 19:302,66715,485,3295,357,0001,311,0002,113,536
8May 29, 2026 19:302,71515,581,8595,481,0001,308,0002,113,536
9May 29, 2026 19:302,73214,871,1095,501,0001,329,0002,113,536