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 07:41Victor MerckléVictor MerckléScore: 2,630Success
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 07:422,54315,864,1215,018,0001,341,0002,113,536
2May 30, 2026 07:422,60915,302,5615,148,0001,376,0002,113,536
3May 30, 2026 07:422,61814,308,7005,208,0001,339,0002,113,536
4May 30, 2026 07:422,62714,285,5545,232,0001,337,0002,113,536
5May 30, 2026 07:422,63015,089,9205,241,0001,335,0002,113,536
6May 30, 2026 07:422,63115,135,0845,243,0001,336,0002,113,536
7May 30, 2026 07:422,63714,231,1425,261,0001,333,0002,113,536
8May 30, 2026 07:422,65015,167,6725,277,0001,348,0002,113,536
9May 30, 2026 07:422,66314,988,9545,307,0001,352,0002,113,536