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 29, 2026 11:08olliecrowolliecrowScore: 4,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 11:123,89728,453,4287,578,0002,165,0002,359,296
2Apr 29, 2026 11:123,93031,409,2587,860,0001,965,0002,371,584
3Apr 29, 2026 11:124,03432,282,8058,068,0002,017,0002,371,584
4Apr 29, 2026 11:124,08430,647,6908,170,0002,042,0002,371,584
5Apr 29, 2026 11:124,15427,354,9508,309,0002,077,0002,363,392
6Apr 29, 2026 11:124,16030,123,7208,322,0002,080,0002,363,392
7Apr 29, 2026 11:124,16126,847,1188,323,0002,080,0002,355,200
8Apr 29, 2026 11:124,17627,866,2539,282,0001,160,0002,355,200
9Apr 29, 2026 11:124,18527,097,4469,417,0001,046,0002,359,296