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 22, 2026 20:39Dominique GarmierDominique GarmierScore: 8,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 20:418,48737,226,93517,178,0004,041,0002,535,424
2Apr 22, 2026 20:418,49638,588,09015,173,0006,069,0002,531,328
3Apr 22, 2026 20:418,49737,412,86814,163,0007,081,0002,531,328
4Apr 22, 2026 20:418,50938,651,09116,208,0005,065,0002,428,928
5Apr 22, 2026 20:418,55234,279,50917,308,0004,072,0002,523,136
6Apr 22, 2026 20:418,57643,985,10617,357,0004,084,0002,551,808
7Apr 22, 2026 20:418,62437,413,87618,481,0003,080,0002,535,424
8Apr 22, 2026 20:418,63038,767,47717,466,0004,109,0002,527,232
9Apr 22, 2026 20:418,70239,520,87617,612,0004,144,0002,297,856