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 3, 2026 04:01Josu San MartinJosu San MartinScore: 5,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:025,16752,320,65040,182,0002,194,0002,113,536
2Sep 3, 2026 04:025,22952,873,95540,601,0002,280,0002,113,536
3Sep 3, 2026 04:025,23753,001,53640,543,0002,403,0002,113,536
4Sep 3, 2026 04:025,26054,015,01241,092,0002,046,0002,113,536
5Sep 3, 2026 04:025,26853,237,78240,792,0002,408,0002,113,536
6Sep 3, 2026 04:025,28253,404,02740,972,0002,346,0002,113,536
7Sep 3, 2026 04:025,28553,590,59041,087,0002,253,0002,113,536
8Sep 3, 2026 04:025,28553,382,75141,048,0002,294,0002,113,536
9Sep 3, 2026 04:0219,994173,917,835157,112,0006,841,0002,117,632