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 listSep 15, 2026 02:30Victor MerckléVictor MerckléScore: 1,413Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 02:311,36512,205,5421,834,0001,580,0002,117,632stderr
2Sep 15, 2026 02:311,37312,120,9651,846,0001,587,0002,117,632stderr
3Sep 15, 2026 02:311,37412,182,4121,849,0001,587,0002,117,632stderr
4Sep 15, 2026 02:311,37812,285,1161,856,0001,591,0002,117,632stderr
5Sep 15, 2026 02:311,41312,335,7771,909,0001,625,0002,117,632stderr
6Sep 15, 2026 02:311,42712,159,7561,829,0001,740,0002,117,632stderr
7Sep 15, 2026 02:311,44312,322,9342,015,0001,594,0002,117,632stderr
8Sep 15, 2026 02:311,47012,427,2682,115,0001,560,0002,117,632stderr
9Sep 15, 2026 02:311,47213,174,2672,079,0001,603,0002,117,632stderr