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 29, 2026 23:55Victor MerckléVictor MerckléScore: 2,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:572,69815,344,5435,432,0001,313,0002,113,536
2May 29, 2026 23:572,69916,286,4505,434,0001,314,0002,113,536
3May 29, 2026 23:572,70114,538,7765,441,0001,313,0002,113,536
4May 29, 2026 23:572,70115,268,1075,439,0001,315,0002,113,536
5May 29, 2026 23:572,73915,065,5495,516,0001,333,0002,113,536
6May 29, 2026 23:572,77115,690,9165,615,0001,314,0002,113,536
7May 29, 2026 23:572,77215,277,0655,622,0001,310,0002,113,536
8May 29, 2026 23:572,77815,781,0714,922,0002,025,0002,113,536
9May 29, 2026 23:572,80914,810,2845,694,0001,330,0002,113,536