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 19:31Victor MerckléVictor MerckléScore: 2,680Success
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 19:322,56814,222,8645,107,0001,315,0002,113,536
2May 29, 2026 19:322,58215,060,7855,141,0001,316,0002,113,536
3May 29, 2026 19:322,60818,617,3985,191,0001,331,0002,113,536
4May 29, 2026 19:322,61616,443,4235,210,0001,332,0002,113,536
5May 29, 2026 19:322,68014,532,1845,347,0001,353,0002,113,536
6May 29, 2026 19:322,68915,392,0985,413,0001,310,0002,113,536
7May 29, 2026 19:322,70315,879,6735,449,0001,310,0002,113,536
8May 29, 2026 19:322,70614,625,7635,423,0001,344,0002,113,536
9May 29, 2026 19:322,71314,492,3945,474,0001,310,0002,113,536