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 12, 2026 14:12limanjun99limanjun99Score: 38,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 14:1238,442123,968,82793,101,0003,003,000823,296
2Apr 12, 2026 14:1238,505121,254,15794,258,0002,005,000798,720
3Apr 12, 2026 14:1238,530120,720,10494,319,0002,006,000909,312
4Apr 12, 2026 14:1238,535133,125,59693,328,0003,010,000819,200
5Apr 12, 2026 14:1238,539120,625,40693,338,0003,010,000794,624
6Apr 12, 2026 14:1238,559123,261,52992,381,0004,016,000786,432
7Apr 12, 2026 14:1238,560121,072,68791,379,0005,020,000839,680
8Apr 12, 2026 14:1238,616122,648,31693,525,0003,016,000905,216
9Apr 12, 2026 14:1238,644120,870,96794,599,0002,012,000835,584