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 30, 2026 08:28Victor MerckléVictor MerckléScore: 2,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 08:302,54515,959,5645,003,0001,360,0002,113,536
2May 30, 2026 08:302,55915,457,5905,030,0001,369,0002,113,536
3May 30, 2026 08:302,59016,367,1155,095,0001,382,0002,113,536
4May 30, 2026 08:302,65016,502,1105,264,0001,363,0002,113,536
5May 30, 2026 08:302,65715,154,5105,273,0001,370,0002,113,536
6May 30, 2026 08:302,66816,424,1045,262,0001,408,0002,113,536
7May 30, 2026 08:302,67016,327,8965,300,0001,377,0002,113,536
8May 30, 2026 08:302,67819,085,6085,283,0001,412,0002,113,536
9May 30, 2026 08:302,71914,928,8954,400,0002,398,0002,113,536