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 listApr 30, 2026 13:04Victor MerckléVictor MerckléScore: 122,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 13:04121,809320,156,524300,517,0004,006,0002,494,464stderr
2Apr 30, 2026 13:04121,818320,812,038301,542,0003,005,0002,502,656stderr
3Apr 30, 2026 13:04121,826322,176,232301,560,0003,005,0002,498,560stderr
4Apr 30, 2026 13:04121,870326,138,927298,682,0005,993,0002,494,464stderr
5Apr 30, 2026 13:04122,206321,358,673301,522,0003,993,0002,498,560stderr
6Apr 30, 2026 13:04122,469326,163,520301,172,0005,002,0002,494,464stderr
7Apr 30, 2026 13:04122,822328,957,823301,055,0006,001,0002,314,240stderr
8Apr 30, 2026 13:04122,851326,767,386301,126,0006,002,0002,502,656stderr
9Apr 30, 2026 13:04123,110327,141,450301,780,0005,995,0002,506,752stderr