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 20, 2026 15:35olliecrowolliecrowScore: 8,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:368,18939,347,31317,402,0003,071,0002,473,984
2Apr 20, 2026 15:368,20644,266,46317,438,0003,077,0002,465,792
3Apr 20, 2026 15:368,29646,215,20319,703,0001,037,0002,473,984
4Apr 20, 2026 15:368,37938,195,19516,958,0003,990,0002,494,464
5Apr 20, 2026 15:368,51433,307,66717,232,0004,054,0002,301,952
6Apr 20, 2026 15:368,52438,355,85918,267,0003,044,0002,260,992
7Apr 20, 2026 15:368,55232,273,94519,346,0002,036,0002,273,280
8Apr 20, 2026 15:368,63036,203,88518,494,0003,082,0002,260,992
9Apr 20, 2026 15:368,65132,245,44019,569,0002,059,0002,256,896