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 14, 2026 00:51Andrew EpsteinAndrew EpsteinScore: 1,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:521,29911,621,2793,249,0000524,288
2Sep 14, 2026 00:521,30011,637,0073,250,0000524,288
3Sep 14, 2026 00:521,41411,865,5423,535,0000524,288
4Sep 14, 2026 00:521,41511,803,0483,538,0000524,288
5Sep 14, 2026 00:521,41611,904,5583,540,0000524,288
6Sep 14, 2026 00:521,42211,946,5933,557,0000524,288
7Sep 14, 2026 00:521,42311,898,5763,558,0000524,288
8Sep 14, 2026 00:521,42612,346,2983,566,0000524,288
9Sep 14, 2026 00:521,46611,984,4153,667,0000524,288