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 23:49Victor MerckléVictor MerckléScore: 2,537Success
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 23:502,52614,231,0034,986,0001,331,0002,113,536
2May 29, 2026 23:502,53117,270,1024,995,0001,334,0002,113,536
3May 29, 2026 23:502,53214,229,6184,997,0001,335,0002,113,536
4May 29, 2026 23:502,53715,943,1495,010,0001,334,0002,113,536
5May 29, 2026 23:502,53716,913,8555,009,0001,334,0002,113,536
6May 29, 2026 23:502,58214,611,5895,101,0001,355,0002,113,536
7May 29, 2026 23:502,59315,741,8875,117,0001,367,0002,113,536
8May 29, 2026 23:502,61914,229,2815,216,0001,332,0002,113,536
9May 29, 2026 23:502,65415,277,0435,290,0001,347,0002,113,536