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:40Josu San MartinJosu San MartinScore: 3,538Success
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:413,49338,715,07326,614,0002,036,0002,117,632
2Sep 3, 2026 05:413,50138,601,85626,624,0002,085,0002,117,632
3Sep 3, 2026 05:413,53439,052,86626,928,0002,058,0002,117,632
4Sep 3, 2026 05:413,53638,954,68026,906,0002,097,0002,117,632
5Sep 3, 2026 05:413,53838,899,09626,896,0002,123,0002,117,632
6Sep 3, 2026 05:413,54139,111,15426,919,0002,125,0002,117,632
7Sep 3, 2026 05:413,54739,071,73327,042,0002,049,0002,117,632
8Sep 3, 2026 05:413,55339,113,14127,092,0002,045,0002,117,632
9Sep 3, 2026 05:4111,527104,467,89692,428,0002,095,0002,117,632