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 08:36limanjun99limanjun99Score: 3,404Success
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 08:363,38025,131,3715,281,0003,169,0002,510,848
2Apr 13, 2026 08:363,39124,278,2675,299,0003,179,0002,510,848
3Apr 13, 2026 08:363,39628,787,6295,307,0003,184,0002,293,760
4Apr 13, 2026 08:363,39827,629,3327,434,0001,062,0002,510,848
5Apr 13, 2026 08:363,40427,896,2447,446,0001,063,0002,351,104
6Apr 13, 2026 08:363,43128,385,8525,361,0003,217,0002,289,664
7Apr 13, 2026 08:363,44624,282,0076,461,0002,153,0002,502,656
8Apr 13, 2026 08:363,51124,981,5546,584,0002,194,0002,465,792
9Apr 13, 2026 08:363,51429,739,6675,490,0003,294,0002,506,752