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:40Josu San MartinJosu San MartinScore: 4,146Success
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:414,08043,433,66231,188,0002,274,0002,113,536
2Sep 3, 2026 04:414,12043,783,34731,471,0002,314,0002,113,536
3Sep 3, 2026 04:414,13844,293,18531,543,0002,389,0002,113,536
4Sep 3, 2026 04:414,14244,795,68831,656,0002,309,0002,113,536
5Sep 3, 2026 04:414,14644,725,83831,585,0002,416,0002,113,536
6Sep 3, 2026 04:414,22845,604,40132,616,0002,059,0002,113,536
7Sep 3, 2026 04:4110,56396,636,09380,218,0006,403,0002,113,536
8Sep 3, 2026 04:4121,674188,499,809170,236,0007,495,0002,117,632
9Sep 3, 2026 04:4122,480195,187,489177,914,0006,426,0002,117,632