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 listNov 2, 2026 23:26Andrew EpsteinAndrew EpsteinScore: 1,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 23:301,16912,156,9322,923,00002,117,632
2Nov 2, 2026 23:301,17013,208,9462,925,00002,117,632
3Nov 2, 2026 23:301,17012,198,2832,926,00002,117,632
4Nov 2, 2026 23:301,17612,123,0242,940,00002,117,632
5Nov 2, 2026 23:301,25612,379,7873,141,00002,117,632
6Nov 2, 2026 23:301,29112,879,9822,215,0001,013,0002,117,632
7Nov 2, 2026 23:301,29112,473,5622,211,0001,017,0002,117,632
8Nov 2, 2026 23:301,29212,419,4982,210,0001,022,0002,117,632
9Nov 2, 2026 23:301,29712,465,7492,215,0001,029,0002,117,632