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 listJul 7, 2026 23:09Victor MerckléVictor MerckléScore: 1,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 23:111,59012,048,6262,871,0001,106,0002,117,632stderr
2Jul 7, 2026 23:111,60012,076,5742,885,0001,115,0002,117,632stderr
3Jul 7, 2026 23:111,60012,072,6702,709,0001,291,0002,117,632stderr
4Jul 7, 2026 23:111,60012,284,0842,702,0001,300,0002,117,632stderr
5Jul 7, 2026 23:111,60312,041,4922,708,0001,300,0002,117,632stderr
6Jul 7, 2026 23:111,60612,018,3692,889,0001,126,0002,117,632stderr
7Jul 7, 2026 23:111,60712,030,2462,887,0001,132,0002,117,632stderr
8Jul 7, 2026 23:111,65312,148,0972,991,0001,142,0002,117,632stderr
9Jul 7, 2026 23:111,65512,256,8582,853,0001,285,0002,117,632stderr