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 listSep 19, 2026 19:41Andrew EpsteinAndrew EpsteinScore: 44,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:4244,712377,260,231365,640,0001,003,0002,117,632stderr
2Sep 19, 2026 19:4244,753377,458,673365,954,0001,023,0002,117,632stderr
3Sep 19, 2026 19:4244,885378,589,464367,055,0001,003,0002,117,632stderr
4Sep 19, 2026 19:4244,905378,612,665367,199,0001,026,0002,117,632stderr
5Sep 19, 2026 19:4244,951379,074,968367,598,0001,002,0002,117,632stderr
6Sep 19, 2026 19:4245,007380,245,569367,912,0001,147,0002,117,632stderr
7Sep 19, 2026 19:4245,044380,501,190368,361,0001,005,0002,117,632stderr
8Sep 19, 2026 19:4245,111380,473,701368,911,0001,003,0002,117,632stderr
9Sep 19, 2026 19:4245,420383,009,298371,444,0001,003,0002,117,632stderr