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:20Josu San MartinJosu San MartinScore: 4,169Success
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:214,14244,004,62631,682,0002,285,0002,113,536
2Sep 3, 2026 04:214,14444,034,70931,728,0002,256,0002,113,536
3Sep 3, 2026 04:214,16044,130,39731,835,0002,282,0002,113,536
4Sep 3, 2026 04:214,16644,276,14431,917,0002,249,0002,113,536
5Sep 3, 2026 04:214,16944,902,72731,808,0002,381,0002,113,536
6Sep 3, 2026 04:214,19844,485,86032,017,0002,414,0002,113,536
7Sep 3, 2026 04:214,20545,204,15832,113,0002,370,0002,113,536
8Sep 3, 2026 04:214,21344,607,56132,487,0002,062,0002,113,536
9Sep 3, 2026 04:214,23044,655,86232,409,0002,282,0002,113,536