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:23Andrew EpsteinAndrew EpsteinScore: 1,494Success
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:231,34011,911,7143,352,00002,117,632
2Sep 14, 2026 00:231,45912,166,5993,648,00002,117,632
3Sep 14, 2026 00:231,48812,251,3772,719,0001,003,0002,117,632
4Sep 14, 2026 00:231,49012,939,0642,719,0001,006,0002,117,632
5Sep 14, 2026 00:231,49412,951,0602,729,0001,006,0002,117,632
6Sep 14, 2026 00:231,49412,435,7472,727,0001,009,0002,117,632
7Sep 14, 2026 00:231,49712,245,6022,733,0001,010,0002,117,632
8Sep 14, 2026 00:231,49812,243,0062,731,0001,014,0002,117,632
9Sep 14, 2026 00:231,50212,501,4192,740,0001,015,0002,117,632