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 26, 2026 18:20Arseniy KorobenkoArseniy KorobenkoScore: 9,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 18:209,853107,562,10179,789,0001,009,0002,420,736
2Mar 26, 2026 18:209,856107,903,94977,823,0002,993,0002,281,472
3Mar 26, 2026 18:209,865104,666,43878,900,0001,997,0002,293,760