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 17, 2026 06:33Jacob McDanielJacob McDanielScore: 10,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:3410,60735,483,18122,271,0004,248,0002,113,536
2May 17, 2026 06:3410,67335,393,17322,468,0004,216,0002,113,536
3May 17, 2026 06:3410,72536,032,19522,540,0004,273,0002,113,536
4May 17, 2026 06:3410,83337,915,27322,447,0004,637,0002,113,536
5May 17, 2026 06:3410,87638,490,56522,952,0004,240,0002,113,536
6May 17, 2026 06:3411,12238,808,76223,181,0004,625,0002,113,536
7May 17, 2026 06:3411,23537,125,54423,704,0004,385,0002,113,536
8May 17, 2026 06:3411,31438,892,80923,971,0004,315,0002,113,536
9May 17, 2026 06:3411,50439,900,74624,470,0004,291,0002,113,536