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 22:49Victor MerckléVictor MerckléScore: 2,561Success
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 22:512,52115,890,2464,975,0001,328,0002,113,536
2May 29, 2026 22:512,52816,501,1594,992,0001,329,0002,113,536
3May 29, 2026 22:512,56016,004,8995,072,0001,330,0002,113,536
4May 29, 2026 22:512,56115,845,5205,056,0001,348,0002,113,536
5May 29, 2026 22:512,56114,171,2935,056,0001,347,0002,113,536
6May 29, 2026 22:512,58817,143,8495,143,0001,329,0002,113,536
7May 29, 2026 22:512,62614,681,5785,241,0001,326,0002,113,536
8May 29, 2026 22:512,62814,832,3585,226,0001,345,0002,113,536
9May 29, 2026 22:512,64116,957,1415,265,0001,338,0002,113,536