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 listApr 25, 2026 11:29olliecrowolliecrowScore: 35,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 11:313,61446,875,93028,618,0001,022,0002,572,288
2Apr 25, 2026 11:313,63438,077,48825,830,0003,973,0002,322,432
3Apr 25, 2026 11:313,69138,513,51626,234,0004,036,0002,437,120
4Apr 25, 2026 11:313,86139,889,93729,625,0002,043,0002,412,544
5Apr 25, 2026 11:3135,318298,225,003284,619,0004,993,0002,490,368
6Apr 25, 2026 11:3135,350298,484,576284,877,0004,997,0002,441,216
7Apr 25, 2026 11:3135,422309,153,238287,468,0002,994,0002,486,272
8Apr 25, 2026 11:3135,496298,736,930286,068,0005,001,0002,367,488
9Apr 25, 2026 11:3135,588300,404,345287,825,0003,997,0002,560,000