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 4, 2026 09:13Victor MerckléVictor MerckléScore: 119,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 09:13118,503314,304,573284,312,00011,947,0002,433,024stderr
2May 4, 2026 09:13118,880314,266,984284,325,00012,875,0002,412,544stderr
3May 4, 2026 09:13118,889314,976,041284,230,00012,993,0002,428,928stderr
4May 4, 2026 09:13118,994312,799,378284,280,00013,206,0002,433,024stderr
5May 4, 2026 09:13119,050313,214,163284,290,00013,335,0002,408,448stderr
6May 4, 2026 09:13119,180315,103,387284,347,00013,603,0002,437,120stderr
7May 4, 2026 09:13119,245315,187,358284,342,00013,771,0002,428,928stderr
8May 4, 2026 09:13119,309316,466,295284,502,00013,772,0002,412,544stderr
9May 4, 2026 09:13119,838318,448,758286,180,00013,415,0002,424,832stderr