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 18, 2026 06:35limanjun99limanjun99Score: 112,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 06:35105,689895,107,693736,703,000129,947,0002,281,472
2Mar 18, 2026 06:35112,451945,523,100786,231,000135,867,0002,322,432
3Mar 18, 2026 06:35120,8221,018,202,017860,906,000129,835,0002,437,120