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 listSep 14, 2026 00:28Andrew EpsteinAndrew EpsteinScore: 1,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:291,27211,734,3733,182,00002,117,632
2Sep 14, 2026 00:291,35711,932,7363,393,00002,117,632
3Sep 14, 2026 00:291,38612,095,7643,467,00002,117,632
4Sep 14, 2026 00:291,41912,161,6622,539,0001,010,0002,117,632
5Sep 14, 2026 00:291,42012,178,8343,551,00002,117,632
6Sep 14, 2026 00:291,42112,028,2512,543,0001,011,0002,117,632
7Sep 14, 2026 00:291,42412,120,9702,547,0001,014,0002,117,632
8Sep 14, 2026 00:291,42812,092,9062,553,0001,019,0002,117,632
9Sep 14, 2026 00:291,42912,810,6832,551,0001,022,0002,117,632