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 listJan 5, 2026 09:03Rajarshi BasuRajarshi BasuScore: 73,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 09:024,94361,972,01935,469,0005,067,0002,531,328
2Jan 5, 2026 09:024,98963,734,96734,920,0005,986,0002,523,136
3Jan 5, 2026 09:045,14068,065,12735,127,0007,025,0002,514,944
4Jan 5, 2026 09:045,14871,842,77934,362,0007,854,0002,293,760
5Jan 5, 2026 09:0272,039618,640,187457,007,000133,709,0002,293,760
6Jan 5, 2026 09:0272,416620,000,788469,849,000123,960,0002,523,136
7Jan 5, 2026 09:0373,229628,010,561481,781,000118,699,0002,441,216
8Jan 5, 2026 09:0473,816632,011,384474,447,000130,847,0002,453,504
9Jan 5, 2026 09:0375,995645,082,520482,348,000140,809,0002,531,328
10Jan 5, 2026 09:0377,080665,651,267510,238,000121,818,0002,510,848
11Jan 5, 2026 09:0295,769811,547,674657,257,000128,050,0002,408,448
12Jan 5, 2026 09:0299,267841,265,115685,152,000128,840,0002,449,408