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 05:27Josu San MartinJosu San MartinScore: 3,604Success
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 05:283,55939,324,78128,137,0001,054,0002,113,536
2Sep 3, 2026 05:283,56039,200,16328,147,0001,049,0002,113,536
3Sep 3, 2026 05:283,57440,111,92828,242,0001,065,0002,113,536
4Sep 3, 2026 05:283,58639,530,15228,372,0001,039,0002,113,536
5Sep 3, 2026 05:283,60439,611,23628,499,0001,055,0002,113,536
6Sep 3, 2026 05:2817,094151,010,436133,993,0006,184,0002,117,632
7Sep 3, 2026 05:2819,900174,019,018156,755,0006,431,0002,117,632
8Sep 3, 2026 05:2820,159176,219,535159,019,0006,292,0002,117,632
9Sep 3, 2026 05:2821,190183,724,397167,306,0006,453,0002,117,632