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 17, 2026 18:09T PrathamT PrathamScore: 11,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 18:0911,617119,769,54487,237,0008,021,0002,506,752
2Mar 17, 2026 18:0911,648122,673,49287,470,0008,043,0002,506,752
3Mar 17, 2026 18:0911,652121,676,37389,516,0006,034,0002,506,752
4Mar 17, 2026 18:0911,675131,660,46288,757,0006,980,0002,506,752
5Mar 17, 2026 18:0911,685119,114,12388,828,0006,986,0002,506,752
6Mar 17, 2026 18:0911,701117,221,00689,953,0005,996,0002,506,752
7Mar 17, 2026 18:0911,750122,246,84887,315,0009,032,0002,506,752
8Mar 17, 2026 18:0911,774117,968,88990,576,0005,972,0002,506,752
9Mar 17, 2026 18:0911,807119,249,41089,831,0006,986,0002,478,080