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 27, 2026 03:17Charles CabergsCharles CabergsScore: 7,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 03:177,08233,505,66010,821,0006,886,0002,355,200
2Apr 27, 2026 03:177,08334,707,44912,500,0005,208,0002,531,328
3Apr 27, 2026 03:177,12832,279,76112,870,0004,950,0002,531,328
4Apr 27, 2026 03:177,13139,461,40112,585,0005,244,0002,527,232
5Apr 27, 2026 03:177,13636,072,23212,885,0004,955,0002,523,136
6Apr 27, 2026 03:177,16632,104,43012,940,0004,977,0002,535,424
7Apr 27, 2026 03:177,17137,449,80713,945,0003,984,0002,363,392
8Apr 27, 2026 03:177,20337,978,03813,007,0005,002,0002,396,160
9Apr 27, 2026 03:177,37239,056,23012,288,0006,144,0002,539,520