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 09:52Victor MerckléVictor MerckléScore: 2,835Success
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 09:542,71816,860,6645,456,0001,339,0002,113,536
2May 29, 2026 09:542,73114,574,6555,485,0001,344,0002,113,536
3May 29, 2026 09:542,73416,543,3685,492,0001,343,0002,113,536
4May 29, 2026 09:542,76414,596,4875,565,0001,346,0002,113,536
5May 29, 2026 09:542,83515,058,4575,750,0001,338,0002,113,536
6May 29, 2026 09:542,85215,376,7865,795,0001,337,0002,113,536
7May 29, 2026 09:542,87815,135,5315,848,0001,348,0002,113,536
8May 29, 2026 09:542,91716,346,8924,984,0002,309,0002,113,536
9May 29, 2026 09:542,91918,111,2324,968,0002,331,0002,113,536