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 25, 2026 18:05olliecrowolliecrowScore: 4,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 18:074,67933,095,4759,572,0002,127,0002,359,296
2Apr 25, 2026 18:074,69128,866,2459,597,0002,132,0002,396,160
3Apr 25, 2026 18:074,69430,016,92810,669,0001,066,0002,387,968
4Apr 25, 2026 18:074,76028,520,6139,918,0001,983,0002,400,256
5Apr 25, 2026 18:074,85426,841,1589,103,0003,034,0002,355,200
6Apr 25, 2026 18:074,94628,252,10010,305,0002,061,0002,392,064
7Apr 25, 2026 18:074,98329,015,55710,382,0002,076,0002,392,064
8Apr 25, 2026 18:075,13427,304,95210,861,0001,974,0002,359,296
9Apr 25, 2026 18:075,20033,433,0958,000,0005,000,0002,387,968