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:40Victor MerckléVictor MerckléScore: 2,572Success
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:422,53414,828,6665,004,0001,331,0002,113,536
2May 29, 2026 23:422,53615,188,1285,007,0001,334,0002,113,536
3May 29, 2026 23:422,53614,123,6145,015,0001,327,0002,113,536
4May 29, 2026 23:422,54315,918,2985,030,0001,329,0002,113,536
5May 29, 2026 23:422,57214,426,6535,084,0001,347,0002,113,536
6May 29, 2026 23:422,62614,343,1655,236,0001,329,0002,113,536
7May 29, 2026 23:422,62815,288,5235,244,0001,328,0002,113,536
8May 29, 2026 23:422,63615,746,4985,264,0001,328,0002,113,536
9May 29, 2026 23:422,66214,530,0805,316,0001,340,0002,113,536