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 listJun 2, 2026 07:57Victor MerckléVictor MerckléScore: 2,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 07:592,15713,224,5904,152,0001,242,0002,113,536
2Jun 2, 2026 07:592,16213,057,7244,161,0001,245,0002,113,536
3Jun 2, 2026 07:592,16313,057,5274,162,0001,247,0002,113,536
4Jun 2, 2026 07:592,17613,305,8044,191,0001,249,0002,113,536
5Jun 2, 2026 07:592,17613,130,2044,195,0001,247,0002,113,536
6Jun 2, 2026 07:592,18813,143,1724,208,0001,264,0002,113,536
7Jun 2, 2026 07:592,24613,636,2964,364,0001,252,0002,113,536
8Jun 2, 2026 07:592,25013,217,0814,374,0001,252,0002,113,536
9Jun 2, 2026 07:592,32213,743,6833,671,0002,136,0002,113,536