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:36Josu San MartinJosu San MartinScore: 3,563Success
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:373,52038,855,81926,730,0002,141,0002,117,632
2Sep 3, 2026 05:373,52838,865,72826,922,0002,014,0002,117,632
3Sep 3, 2026 05:373,55339,168,06827,088,0002,048,0002,117,632
4Sep 3, 2026 05:373,55939,058,66627,169,0002,021,0002,117,632
5Sep 3, 2026 05:373,56339,237,20127,187,0002,034,0002,117,632
6Sep 3, 2026 05:373,56339,914,64927,183,0002,038,0002,117,632
7Sep 3, 2026 05:373,57139,204,97727,143,0002,146,0002,117,632
8Sep 3, 2026 05:373,59339,464,05527,177,0002,293,0002,117,632
9Sep 3, 2026 05:373,59940,968,44327,474,0002,043,0002,117,632