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 listApr 13, 2026 13:59limanjun99limanjun99Score: 3,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 13:592,99624,327,8255,350,0002,140,0002,523,136
2Apr 13, 2026 13:593,02926,844,6995,409,0002,163,0002,277,376
3Apr 13, 2026 13:593,03829,997,8205,426,0002,170,0002,293,760
4Apr 13, 2026 13:593,04229,488,7896,520,0001,086,0002,277,376
5Apr 13, 2026 13:593,04626,561,8185,440,0002,176,0002,293,760
6Apr 13, 2026 13:593,05323,656,4845,452,0002,181,0002,293,760
7Apr 13, 2026 13:593,05824,661,6655,460,0002,184,0002,293,760
8Apr 13, 2026 13:593,05925,045,6825,463,0002,185,0002,293,760
9Apr 13, 2026 13:593,18128,374,4455,681,0002,272,0002,293,760