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 8, 2026 01:19Victor MerckléVictor MerckléScore: 1,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 01:211,58311,945,0722,877,0001,081,0002,117,632stderr
2Jul 8, 2026 01:211,58812,016,5602,879,0001,091,0002,117,632stderr
3Jul 8, 2026 01:211,59712,153,6042,888,0001,106,0002,117,632stderr
4Jul 8, 2026 01:211,59912,045,0182,892,0001,106,0002,117,632stderr
5Jul 8, 2026 01:211,63912,217,9402,860,0001,238,0002,117,632stderr
6Jul 8, 2026 01:211,64212,089,9072,953,0001,154,0002,117,632stderr
7Jul 8, 2026 01:211,66612,197,5262,912,0001,254,0002,117,632stderr
8Jul 8, 2026 01:211,71012,699,3453,155,0001,120,0002,117,632stderr
9Jul 8, 2026 01:211,73212,914,7043,176,0001,156,0002,117,632stderr