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 00:47Victor MerckléVictor MerckléScore: 2,564Success
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 00:482,52814,103,6954,993,0001,329,0002,113,536
2May 30, 2026 00:482,52917,178,9194,994,0001,329,0002,113,536
3May 30, 2026 00:482,53016,303,3775,000,0001,327,0002,113,536
4May 30, 2026 00:482,54214,201,1045,020,0001,336,0002,113,536
5May 30, 2026 00:482,56415,829,6515,062,0001,348,0002,113,536
6May 30, 2026 00:482,62414,680,8125,234,0001,327,0002,113,536
7May 30, 2026 00:482,63014,522,9985,249,0001,326,0002,113,536
8May 30, 2026 00:482,68315,749,8324,446,0002,263,0002,113,536
9May 30, 2026 00:482,69114,451,1994,457,0002,271,0002,113,536