Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listMar 14, 2026 21:01Elijah KinElijah KinScore: 101,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:0175,590647,378,426419,889,000199,947,0002,408,448
2Mar 14, 2026 21:0191,304771,647,688556,769,000191,920,0002,404,352
3Mar 14, 2026 21:0193,310796,670,974574,357,000190,786,0002,478,080
4Mar 14, 2026 21:0199,556837,302,206615,516,000200,842,0002,301,952
5Mar 14, 2026 21:01101,209859,879,809635,167,000194,744,0002,506,752
6Mar 14, 2026 21:01104,887887,001,447668,279,000191,793,0002,297,856
7Mar 14, 2026 21:01111,515940,553,158727,541,000186,882,0002,310,144
8Mar 14, 2026 21:01118,392996,640,962784,045,000186,772,0002,277,376
9Mar 14, 2026 21:01120,0181,014,054,783785,322,000198,828,0002,277,376