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 listMar 12, 2026 20:15Josu San MartinJosu San MartinScore: 11,205Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 20:153,32554,637,36325,246,0002,019,0002,465,792
2Mar 12, 2026 20:1511,205119,845,07388,881,0002,996,0002,363,392
3Mar 12, 2026 20:1511,218115,016,66689,985,0001,999,0002,342,912