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 28, 2026 00:37Victor MerckléVictor MerckléScore: 21,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 00:3720,96068,018,92448,370,0004,030,0002,535,424
2Apr 28, 2026 00:3721,09873,103,66347,675,0005,071,0002,379,776
3Apr 28, 2026 00:3721,18671,518,90847,969,0004,996,0002,519,040
4Apr 28, 2026 00:3721,39271,049,20550,455,0003,027,0002,527,232
5Apr 28, 2026 00:3721,49276,167,13047,761,0005,970,0002,519,040
6Apr 28, 2026 00:3721,51376,347,92848,710,0005,074,0002,531,328
7Apr 28, 2026 00:3721,58176,738,88449,958,0003,996,0002,523,136
8Apr 28, 2026 00:3721,98372,292,54948,963,0005,995,0002,523,136
9Apr 28, 2026 00:3722,04170,174,01750,095,0005,009,0002,519,040