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 listJun 1, 2026 09:43Victor MerckléVictor MerckléScore: 2,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 09:442,51713,836,4554,968,0001,325,0002,113,536
2Jun 1, 2026 09:442,52313,896,2844,980,0001,328,0002,113,536
3Jun 1, 2026 09:442,54213,874,4855,037,0001,318,0002,113,536
4Jun 1, 2026 09:442,58114,071,8575,076,0001,377,0002,113,536
5Jun 1, 2026 09:442,58314,001,1375,145,0001,314,0002,113,536
6Jun 1, 2026 09:442,60514,058,1275,192,0001,322,0002,113,536
7Jun 1, 2026 09:442,60814,037,1725,193,0001,328,0002,113,536
8Jun 1, 2026 09:442,62214,035,1285,231,0001,325,0002,113,536
9Jun 1, 2026 09:442,63624,709,3515,253,0001,339,0002,109,440