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 18, 2026 05:08Josu San MartinJosu San MartinScore: 8,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 05:088,765100,194,56669,874,0001,996,0002,465,792
2Jan 18, 2026 05:088,77595,778,14170,960,000999,0002,514,944
3Jan 18, 2026 05:088,77992,380,12070,989,000999,0002,453,504
4Jan 18, 2026 05:088,77998,689,82968,991,0002,999,0002,428,928
5Jan 18, 2026 05:088,78598,250,01871,040,0001,000,0002,502,656
6Jan 18, 2026 05:088,78695,445,47470,045,0002,001,0002,523,136
7Jan 18, 2026 05:088,79295,474,43571,092,0001,001,0002,457,600
8Jan 18, 2026 05:088,79994,980,57570,146,0002,004,0002,494,464
9Jan 18, 2026 05:088,800100,544,95970,154,0002,004,0002,449,408