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 listSep 26, 2026 12:36Kevin HeaveyKevin HeaveyScore: 1,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 12:371,33811,930,3682,178,0001,168,000524,288
2Sep 26, 2026 12:371,34212,503,3261,926,0001,429,000524,288
3Sep 26, 2026 12:371,34312,456,6272,188,0001,170,000524,288
4Sep 26, 2026 12:371,34512,531,4682,180,0001,184,000524,288
5Sep 26, 2026 12:371,34612,484,1731,925,0001,441,000524,288
6Sep 26, 2026 12:371,34812,492,8752,201,0001,170,000524,288
7Sep 26, 2026 12:371,34812,602,0942,356,0001,016,000524,288
8Sep 26, 2026 12:371,35712,632,3842,369,0001,024,000524,288
9Sep 26, 2026 12:371,38212,601,9302,244,0001,213,000524,288