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 18:28Victor MerckléVictor MerckléScore: 2,588Success
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 18:302,56714,166,8185,104,0001,314,0002,113,536
2May 29, 2026 18:302,56817,296,7465,114,0001,307,0002,113,536
3May 29, 2026 18:302,56815,995,5405,105,0001,315,0002,113,536
4May 29, 2026 18:302,57116,232,3785,119,0001,310,0002,113,536
5May 29, 2026 18:302,58814,505,7565,154,0001,318,0002,113,536
6May 29, 2026 18:302,62316,822,0815,214,0001,344,0002,113,536
7May 29, 2026 18:302,68914,417,6355,416,0001,307,0002,113,536
8May 29, 2026 18:302,69015,018,8535,407,0001,319,0002,113,536
9May 29, 2026 18:302,73214,658,2535,510,0001,322,0002,113,536