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 20, 2026 16:47BenBenScore: 27,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:5127,03496,498,28560,524,0007,061,0002,371,584
2Apr 20, 2026 16:5127,11196,578,13357,811,0009,967,0002,371,584
3Apr 20, 2026 16:5127,23091,731,21057,064,00011,012,0002,416,640
4Apr 20, 2026 16:5127,24692,454,86059,102,0009,015,0002,371,584
5Apr 20, 2026 16:5127,56292,434,25759,919,0008,987,0002,375,680
6Apr 20, 2026 16:5127,63987,103,47261,088,0008,011,0002,408,448
7Apr 20, 2026 16:5127,96395,651,60561,920,0007,989,0002,383,872
8Apr 20, 2026 16:5128,06996,652,78565,162,0005,012,0002,371,584
9Apr 20, 2026 16:5128,11094,637,21262,245,0008,031,0002,379,776