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 24, 2026 14:09olliecrowolliecrowScore: 4,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 14:114,41524,711,5748,028,0003,010,0002,396,160
2Apr 24, 2026 14:114,43627,041,9879,075,0002,016,0002,400,256
3Apr 24, 2026 14:114,43724,745,3419,076,0002,017,0002,400,256
4Apr 24, 2026 14:114,44027,430,2357,065,0004,037,0002,396,160
5Apr 24, 2026 14:114,45527,309,8199,114,0002,025,0002,396,160
6Apr 24, 2026 14:114,62830,558,93210,520,0001,052,0002,347,008
7Apr 24, 2026 14:114,67226,820,9529,558,0002,124,0002,355,200
8Apr 24, 2026 14:114,68528,878,57510,649,0001,064,0002,379,776
9Apr 24, 2026 14:114,69926,370,02110,680,0001,068,0002,461,696