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 20, 2026 16:24Victor MerckléVictor MerckléScore: 2,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:252,71617,437,2735,442,0001,349,0002,113,536
2May 20, 2026 16:252,74217,424,8755,509,0001,348,0002,113,536
3May 20, 2026 16:252,78116,569,7555,612,0001,341,0002,113,536
4May 20, 2026 16:252,83120,344,8235,737,0001,342,0002,113,536
5May 20, 2026 16:252,83316,532,7285,743,0001,341,0002,113,536
6May 20, 2026 16:252,84818,085,8414,798,0002,324,0002,113,536
7May 20, 2026 16:252,85215,195,4995,786,0001,344,0002,113,536
8May 20, 2026 16:252,85617,086,0364,821,0002,320,0002,113,536
9May 20, 2026 16:252,87717,752,1844,872,0002,321,0002,113,536