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 01:18Victor MerckléVictor MerckléScore: 2,542Success
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 01:202,52414,273,5204,983,0001,328,0002,113,536
2May 30, 2026 01:202,52416,212,3804,985,0001,326,0002,113,536
3May 30, 2026 01:202,53416,380,5545,009,0001,328,0002,113,536
4May 30, 2026 01:202,53615,859,4235,013,0001,329,0002,113,536
5May 30, 2026 01:202,54214,309,5985,024,0001,331,0002,113,536
6May 30, 2026 01:202,56614,244,2995,082,0001,333,0002,113,536
7May 30, 2026 01:202,59614,985,5135,125,0001,366,0002,113,536
8May 30, 2026 01:202,59815,883,7905,127,0001,370,0002,113,536
9May 30, 2026 01:202,69215,096,5205,324,0001,406,0002,113,536